Kevin Hendrey, Extremal functions for sparse minors
Room B232 IBS (기초과학연구원)The extremal function
The extremal function
The Alon-Jaeger-Tarsi conjecture states that for any finite field
I am going to present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time $2^{O(\sqrt{k})}(n + …
The Gyárfás-Sumner conjecture says that for every forest
Majority dynamics on a graph
The aim of the Young Researchers in Extremal and Probabilistic Combinatorics is to bring together early career researchers working on these topics. The workshop will consist of several 25 minute …
Bouchet (1987) defined delta-matroids by relaxing the base exchange axiom of matroids. Oum (2009) introduced a graphic delta-matroid from a pair of a graph and its vertex subset. We define …
A family
The independence number of a tree decomposition
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected 2-complex every link graph …