Sebastian Wiederrecht, Killing a vortex
The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every $t\in\mathbb{N},$ there exists some constant $c_{t}$ such that every $K_{t}$-minor-free graph admits a tree …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
Mehtaab Sawhney, Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]An $n$-vertex graph is called $C$-Ramsey if it has no clique or independent set of size $C\log_2 n$ (i.e., if it has near-optimal Ramsey behavior). We study edge-statistics in Ramsey …
-
Alexander Clifton, Ramsey Theory for Diffsequences
Room B332 IBS (기초과학연구원)Van der Waerden's theorem states that any coloring of $\mathbb{N}$ with a finite number of colors will contain arbitrarily long monochromatic arithmetic progressions. This motivates the definition of the van …
-
Santiago Guzmán-Pro, Local expressions of graphs classes
Zoom ID: 869 4632 6610 (ibsdimag)A common technique to characterize hereditary graph classes is to exhibit their minimal obstructions. Sometimes, the set of minimal obstructions might be infinite, or too complicated to describe. For instance, for any …
-
-
Zixiang Xu (徐子翔), On the degenerate Turán problems
Room B332 IBS (기초과학연구원)For a graph $F$, the Turán number is the maximum number of edges in an $n$-vertex simple graph not containing $F$. The celebrated Erdős-Stone-Simonovits Theorem gives that \ where $\chi(F)$ is the …
-
Konstantin Tikhomirov, A remark on the Ramsey number of the hypercube
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]A well-known conjecture of Burr and Erdős asserts that the Ramsey number $r(Q_n)$ of the hypercube $Q_n$ on $2^n$ vertices is of the order $O(2^n)$. In this paper, we show that …
-
Nika Salia, Exact results for generalized extremal problems forbidding an even cycle
Room B332 IBS (기초과학연구원)We determine the maximum number of copies of $K_{s,s}$ in a $C_{2s+2}$-free $n$-vertex graph for all integers $s \ge 2$ and sufficiently large $n$. Moreover, for $s\in\{2,3\}$ and any integer …
-
Xavier Goaoc, Order types and their symmetries
Room 1501, Bldg. E6-1, KAISTOrder types are a combinatorial classification of finite point sets used in discrete and computational geometry. This talk will give an introduction to these objects and their analogue for the …
-
Florent Koechlin, Uniform random expressions lack expressivity
Room B332 IBS (기초과학연구원)In computer science, random expressions are commonly used to analyze algorithms, either to study their average complexity, or to generate benchmarks to test them experimentally. In general, these approaches only …
-
Dabeen Lee (이다빈), Non-smooth and Hölder-smooth submodular optimization
Room 1501, Bldg. E6-1, KAISTWe study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an guarantee when the function is monotone …