Rainbow matchings for 3-uniform hypergraphs

DOI10.1016/J.JCTA.2021.105489zbMath1468.05232arXiv2004.12558OpenAlexW3166438828MaRDI QIDQ2040498

Xiaofan Yuan, Xingxing Yu, Hongliang Lu

Publication date: 14 July 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchingrainbow matching3-graphfractional matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ A better bound on the size of rainbow matchings ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ On the size of the product of overlapping families ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs

Cites Work

• 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
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in 4-uniform hypergraphs
• Near-perfect clique-factors in sparse pseudorandom graphs
• Matchings in 3-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• 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 Perfect Matchings in k-Complexes
• Nearly Perfect Matchings in Uniform 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

This page was built for publication: Rainbow matchings for 3-uniform hypergraphs