Combinatorial group
Here you can find the outputs of the project Embedding, Packing and Limits in Graphs, project number GA19-08740S, funded by the Czech Science foundation. For other outputs, please visit this page. In bold you find the authors that were supported by the grant.

Preprints

Minimum degree conditions for tight Hamilton cycles, R. Lang, N. Sanhueza-Matamala

Longest paths in random hypergraphs, O. Cooley, F. Garbe, E. K. Hng, M. Kang, N. Sanhueza-Matamala, J. Zalla

Universal arrays, M. Pavez-Signé, D. A. Quiroz, N. Sanhueza-Matamala

Counting extensions revisited, M. Šileikis, L. Warnke

Fractional Isomorphism of Graphons J. Grebík, I. Rocha

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

Published

Brouwer's conjecture holds asymptotically almost surely, I. Rocha, Linear Algebra Appl. 597 (2020) 198–205