Nearly Perfect Matchings in Uniform Hypergraphs
From MaRDI portal
Publication:4990402
DOI10.1137/19M1300662zbMath1465.05121arXiv1911.07431MaRDI QIDQ4990402
Hongliang Lu, Xingxing Yu, Xiaofan Yuan
Publication date: 28 May 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07431
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Matching of Given Sizes in Hypergraphs ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ A better bound on the size of rainbow matchings ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Hypergraph containers
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Near perfect coverings in graphs and hypergraphs
- Matchings in 3-uniform hypergraphs
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Recent advances on Dirac-type problems for hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- Independent sets in hypergraphs
- Intersection theorems for systems of finite sets
- Near Perfect Matchings ink-Uniform Hypergraphs
- Probability and Computing
- Matchings in hypergraphs of large minimum degree
This page was built for publication: Nearly Perfect Matchings in Uniform Hypergraphs
