Combinatorial group

Embedding, Packing and Limits in Graphs of the Czech Science Foundation

Extremal graph theory and applications of the Czech Science Foundation

Mimoradna financni dotace urcena na rozvoj spoluprace s prednimi vedecko-vyzkumnymi pracovisti v Izraeli of the Czech Academy of Sciences

For outputs of the members of the group, please refer to their individual web-pages (see here), where you can find as well their publications which were not achieved at the Institute of Computer Sciences.

A limit theorem for small cliques in inhomogeneous random graphs, J. Hladký, C. Pelekis, M. Šileikis

Upper tail bounds for Stars, M. Šileikis, L. Warnke

A Note on the Minimum Number of Edges in Hypergraphs with Property O, G. Kronenberg, C. Kusch, A. Lamaison, P. Micek, T. Tran

A central limit theorem for almost local additive tree functionals, D. Ralaivaosaona, M. Šileikis, S. Wagner

Cut distance identifying graphon parameters over weak* limits, M. Doležal, J. Grebík, J. Hladký, I. Rocha, V. Rozhoň

Relating the cut distance and the weak* topology for graphons, M. Doležal, J. Grebík, J. Hladký, I. Rocha, V. Rozhoň

Independent sets, cliques, and colorings in graphons, J. Hladký, I. Rocha

Packing degenerate graphs, P. Allen, J. Böttcher, J. Hladký, D. Piguet

A fractal perspective on optimal antichains and intersecting subsets of the unit n-cube, K. Engel, T. Mitsis, C. Pelekis

Balanced supersaturation for degenerate hypergraphs, J. Corsten, T. Tran

Improvements on Spectral Bisection, I. Rocha

Tilings in graphons, J. Hladký, P. Hu, D. Piguet

A version of the Loebl-Komlós-Sós conjecture for skewed trees, T. Klimošová, D. Piguet, V. Rozhoň, accepted to the special issue of *European Journal on Combinatorics* for EUROCOMB'17

A counterexample to the DeMarco-Kahn Upper Tail Conjecture, M. Šileikis, L. Warnke, accepted in *Random Structures & Algorithms*

Structure and Supersaturation for Intersecting Families, J. Balogh, S. Das, H. Liu, M. Sharifzadeh, T. Tran, accepted to *Elec. J. Combin.*

On the separation conjecture in Avoider-Enforcer games, M. Bednarska-Bzdega, O. Ben-Eliezer, L. Gishboliner, T. Tran, *J. Combin. Theory Ser. B*, online first.

A local approach to the Erdos-Sos conjecture, V. Rozhoň, *SIAM J. Discrete Math*, 33(2), 643-664.

Minimal Obstructions for Partial Representations of Interval Graphs P. Klavik, M. Saumell, *Electronic Journal of Combinatorics*, 25(4) (2018), #P4.55

A median-type condition for graph tiling, D. Piguet, M. Saumell, *European Journal of Combinatorics*, Volume 77, p.90-101

Layout of random circulant graphs, S. Richter, I. Rocha, *Linear Algebra and its Applications*, Volume 559, p. 95-113

A generalization of Erdos' matching conjecture, C. Pelekis, I. Rocha, * Electronic Journal of Combinatorics*, 25(2), P2.21

Komlós's tiling theorem via graphon covers, J. Hladký, P. Hu, D. Piguet, *Journal of Graph Theory*, Volume 90, Issue 1, January 2019, Pages 24-45

On the structure of large sum-free sets of integers, T. Tran, *Isr. J. Math.* Volume 228, Issue 1, October 2018, pp 249-292

Colourings without monochromatic disjoint pairs, D. Clemens, S. Das, T. Tran, *European Journal of Combinatorics*, Volume 70, May 2018, Pages 99-124

The local limit of the uniform spanning tree on dense graphs, J. Hladký, A. Nachmias, T. Tran, *Journal of Statistical Physics*, Volume 173, Issue 3-4, pp 502-545

Recovering the structure of random linear graphs,
I. Rocha, J. Janssen, N. Kalyaniwalla, *Linear Algebra and its Applications*, 557, 234-264

Peeling Potatoes Near-Optimally in Near-Linear Time,
S. Cabello, J. Cibulka, J. Kynčl, M. Saumell, P. Valtr, * SIAM J. Comput.*, 46(5), 1574-1602

Column planarity and partially-simultaneous geometric embedding,
L. Barba. W. Evans, M. Hoffmann, V. Kusters, M. Saumell, B. Speckmann,
*Journal of Graph Algorithms and Applications*, Vol. 21, no. 6, pp. 983-1002

The Approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition,
J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. J. Stein, E. Szemerédi, *SIAM J. Discrete Math.*, 31(2), 945-982

The Approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs,
J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. J. Stein, E. Szemerédi, *SIAM J. Discrete Math.*, 31(2), 983-1016

The Approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs,
J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. J. Stein, E. Szemerédi, *SIAM J. Discrete Math.*, 31(2), 1017-1071

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result,
J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. J. Stein, E. Szemerédi, *SIAM J. Discrete Math.*, 31(2), 1072-1148

An approximate version of the Tree Packing Conjecture
J. Böttcher, J. Hladký, D. Piguet, A. Taraz,
*Israel Journal of Mathematics*, 211 (1) (2016), 391-446

Loebl-Komlos-Sos Conjecture: dense case,
J. Hladký, D. Piguet,
*Journal of Combinatorial Theory, Series B*, 116 (2016), 123-190

The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs
J. Hladký, D. Piguet, M. Simonovits, M. Stein, E. Szemerédi,
*Electronic Research Announcements in Mathematical Sciences*, 22 (2015) pages 1-11

Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees D. Ralaivaosaona, M. Šileikis, S. Wagner, *29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms (AofA 2018)*

Packing degenerate graphs greedily, P. Allen, J. Böttcher, J. Hladký, D. Piguet, *Electronic Notes in Discrete Mathematics*, Volume 61, August 2017, Pages 45-51. Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017.

First steps in combinatorial optimization on graphons: Matchings, M. Doležal, J. Hladký, P. Hu, D. Piguet, *Electronic Notes in Discrete Mathematics*, Volume 61, August 2017, Pages 359-365. Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017.

A skew version of the Loebl-Komlos-Sos conjecture, T. Klimošová, D. Piguet, V. Rozhoň, *Electronic Notes in Discrete Mathematics*, Volume 61, August 2017, Pages 743-749. Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017.

A Median-Type Condition for Graph Tiling,D. Piguet, M. Saumell, *Electronic Notes in Discrete Mathematics*, Volume 61, August 2017, Pages 979-985. Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017.

Spectral Bisection with Two Eigenvectors, I. Rocha, *Electronic Notes in Discrete Mathematics*, Volume 61, August 2017, Pages 1019-1025