On the matching problem in random hypergraphs

DOI10.1016/J.DISC.2025.114839MaRDI QIDQ6883688zbMATH OpenFDO

Authors Peter Frankl, Jiaxi Nie, Jian Wang

Publication date 16 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114839

zbMATH Keywords

Erdős matching problemrandom hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Transversal (matching) theory (05D15)

Cites work

• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• Erdős-Ko-Rado in random hypergraphs
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Improved bounds for Erdős' matching conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Matching theory
• On Erdős-Ko-Rado for random hypergraphs. I
• On Erdős-Ko-Rado for random hypergraphs. II
• On maximal paths and circuits of graphs
• Resilient hypergraphs with fixed matching number
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Sharp threshold for the Erdős–Ko–Rado theorem
• The Erdős matching conjecture and concentration inequalities
• Turán graphs with bounded matching number

This page was built for publication: On the matching problem in random hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883688)