Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
From MaRDI portal
Publication:5963389
DOI10.4310/JOC.2016.v7.n1.a6zbMath1331.05160arXiv1406.3091OpenAlexW2962739781MaRDI QIDQ5963389
Asaf Ferber, Michael Krivelevich, Benjamin Sudakov
Publication date: 19 February 2016
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3091
Related Items (5)
Counting Hamilton cycles in Dirac hypergraphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Property (T) in density-type models of random groups ⋮ Number of 1-factorizations of regular high-degree graphs ⋮ Decomposing hypergraphs into cycle factors
This page was built for publication: Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs