On the rainbow matching conjecture for 3-uniform hypergraphs
From MaRDI portal
Publication:2090427
DOI10.1007/s11425-020-1890-4zbMath1500.05046arXiv2011.14363OpenAlexW3209968583WikidataQ113900259 ScholiaQ113900259MaRDI QIDQ2090427
Xingxing Yu, Jie Ma, Hongliang Lu, Jun Gao
Publication date: 25 October 2022
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.14363
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Rainbow version of the Erdős Matching Conjecture via concentration ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ A 2-stable family of triple systems ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ On the size of the product of overlapping families
Cites Work
- 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
- On matchings in hypergraphs
- On the maximum number of edges in a hypergraph with given matching number
- Near perfect coverings in graphs and hypergraphs
- Proof of the Erdős matching conjecture in a new range
- Rainbow matchings for 3-uniform hypergraphs
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- On Erdős' extremal problem on matchings in hypergraphs
- The Size of a Hypergraph and its Matching Number
- On a rainbow version of Dirac's theorem
- On the size of graphs with complete-factors
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Nearly Perfect Matchings in Uniform Hypergraphs
- Rainbow matchings in k‐partite hypergraphs
- Simple juntas for shifted families
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: On the rainbow matching conjecture for 3-uniform hypergraphs
