Co-degrees resilience for perfect matchings in random hypergraphs

DOI10.37236/8167zbMath1437.05170arXiv1908.01435OpenAlexW2966472752MaRDI QIDQ2294109

Asaf Ferber, Lior Hirschfeld

Publication date: 10 February 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchingoptimal co-degrees resilience property

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 (2)

Dirac-type theorems in random hypergraphs ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Concentration for Independent Permutations
• Factors in random graphs
• Reducibility among Combinatorial Problems
• HYPERGRAPH MATCHINGS AND DESIGNS
• Matchings in hypergraphs of large minimum degree
• Some Theorems on Abstract Graphs

This page was built for publication: Co-degrees resilience for perfect matchings in random hypergraphs