Packing perfect matchings in random hypergraphs

DOI10.1002/rsa.20745zbMath1387.05234arXiv1606.09492OpenAlexW2962685354MaRDI QIDQ4642740

Van H. Vu, Asaf Ferber

Publication date: 25 May 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphrandom graphsperfect matching

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Packing Loose Hamilton Cycles ⋮ Packing and counting arbitrary Hamilton cycles in random digraphs ⋮ Packing trees of unbounded degrees in random graphs