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

Cycle decompositions in 3-uniform hypergraphs, S. Piga, N. Sanhueza-Matamala

Dirac-type conditions for spanning bounded-degree hypertrees, M. Pavez-Signé, N. Sanhueza-Matamala, M. Stein

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

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

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

Accepted

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

Longest paths in random hypergraphs, O. Cooley, F. Garbe, E. K. Hng, M. Kang, N. Sanhueza-Matamala, J. Zalla, accepted to SIAM Journal on Discrete Mathematics

On sufficient conditions for Hamiltonicity, R. Lang and N. Sanhueza-Matamala, accepted tp Research Perspectives CRM Barcelona, Proceedings of EUROCOMB 2021

Degree conditions for tight Hamilton cycles, R. Lang and N. Sanhueza-Matamala, accepted tp Research Perspectives CRM Barcelona, Proceedings of EUROCOMB 2021

Dirac-type conditions for spanning bounded-degree hypertrees, M. Pavez-Signé, N. Sanhueza-Matamala, and M. Stein, accepted tp Research Perspectives CRM Barcelona, Proceedings of EUROCOMB 2021.

Published

A limit theorem for small cliques in inhomogeneous random graphs, J. Hladký, C. Pelekis, M. Šileikis Journal of Graph Theory, online first: 28 March 2021, DOI:10.1002/jgt.22673

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