Rainbow Perfect Matchings for 4-Uniform Hypergraphs
From MaRDI portal
Publication:5093585
DOI10.1137/21M1442383zbMath1493.05218arXiv2105.08608MaRDI QIDQ5093585
Yan Wang, Hongliang Lu, Xingxing Yu
Publication date: 28 July 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.08608
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs, Rainbow spanning structures in graph and hypergraph systems, A general approach to transversal versions of Dirac‐type theorems
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On matchings in hypergraphs
- Hypergraph containers
- On the maximum number of edges in a hypergraph with given matching number
- Asymptotic behavior of the chromatic index for hypergraphs
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-uniform hypergraphs
- Near perfect coverings in graphs and hypergraphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Matchings in 3-uniform hypergraphs
- Rainbow matchings for 3-uniform hypergraphs
- On the rainbow matching conjecture for 3-uniform hypergraphs
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- On Erdős' extremal problem on matchings in hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- The Size of a Hypergraph and its Matching Number
- On a rainbow version of Dirac's theorem
- On Perfect Matchings in k-Complexes
- On the size of graphs with complete-factors
- Rainbow matchings in k‐partite hypergraphs
- Reducibility among Combinatorial Problems
- Simple juntas for shifted families
- Independent sets in hypergraphs
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- A new generalization of the Erdős-Ko-Rado theorem