Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

DOI10.1137/1.9781611975994.43OpenAlexW2998490286MaRDI QIDQ5146811

Hiệp Hàn, Jie Han, Patrick Morris

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.07254

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Dirac-type theorems in random hypergraphs ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Pseudorandom hypergraph matchings

This page was built for publication: Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs