Extremal graph theory group

The Extremal graph theory group at the Institute of Computer Science of the Czech Academy of Sciences has existed since 2016. Currently, our research is supported by the Czech Science Foundation. We work in extremal graph theory and extremal combinatorics, random graphs, and graph limits.
**current** If you are a hard-working student enrolled at a Czech university (or about to enroll) interested in collaboration (possibly leading to a thesis), check here.

**November, 2017** The concept of a uniform spanning tree (UST) of a graph plays a central role probability theory and mathematical aspects of statistical physics. The main reason for this prominence is the connection to the Schramm-Loewner evolution through loop-erased random walks. The award of the 2006 Fields medal to Wendelin Werner was largely on work on this connection. While the probability community typically investigates USTs of bounded-degree graphs such as large planar grids, Jan Hladky and Tuan Tran, who were both members of ExtrA when the project was initiated, together with Asaf Nachmias of Tel Aviv University looked at the area from the perspective limits of dense graphs. They describe the local structure of any graph that is close to a given graphon. The paper will appear in Journal of Statistical Physics.

**November, 2017** Many of the most important problems in extremal graph theory concern graph packings. In that setting, the task is to find copies of several given graphs into one host graph, so that the copies are edge-disjoint. There has been a flurry of research in the area of graph packing recently (including [1], [2],
[3],
[4], [5]), mostly driven by old Tree Packing conjectures of Ringel and Gyarfas and Lehel. In their recent manuscript, Diana Piguet, a former ExtrA member Jan Hladky, together with Peter Allen and Julia Bottcher of LSE, extend many of these results. They prove that any family of graphs of bounded degeneracy (with a moderate bound on the maximum degree) packs into a complete graph, subject to the obvious condition on not "overpacking".

**July, 2017** Christos Pelekis introduces a Hausdorf dimension point of view on problems in extremal combinatorics.

Sperner's Theorem is a fundamental result about antichains in the hypercube. Version's of Sperner's theorem have been studied for other discrete posets.
In their paper, Christos and his coauthors Konrad Engel (Rostock University) and Themis Mitsis (University of Crete) initiate the study of this problem in an analytic setting of the Euclidean hypercube. The difficulty here is that any antichain trivially is a null set in the sense of the Lebesgue measure. However, using the Hausdorf dimension and the Hausdorf measure allows them to "zoom in" even into such null sets. Using a similar point of view they study analytic version of the Erdos-Ko-Rado theorem. They achieve only partial progress on these problems, and as proving the natural conjectures seems to be a challenge.

**May, 2017** Tuan Tran proves the Hancock-Staden-Treglown Conjecture.

Much of additive combinatorics is concerned with sum-free set, that is, sets of integers in which the equation x+y=z has no solution. There are only two maximum sum-free sets in {1,2,3,...,n}: all the odd numbers, and all numbers bigger than n/2. Even sum-free sets of smaller densities have a rather rigid structure. A complete description of this structure was known down to density 2/5 due to work of Deshouillers, Freiman, Sos and Temkin from 1999. In his paper, Tuan breaks the 2/5 barrier by describing structure of sum-free sets of density more 2/5-c, for some absolute c. This allows him to obtain a stability version of Hu's Theorem [Proc. Amer. Math. Soc. 80 (1980), 711–712] about partitioning sets of integers into two sum-free subsets, which in turn allows him to prove that the number of subsets of {1,2,3,...,n} which can be partitioned into two sum-free sets is O(2^(4n)/5). This confirms a recent conjecture of Hancock, Staden, and Treglown.
This is, as far as we know, the first contribution to additive combinatorics from a researcher at a Czech institution.