A better bound on the size of rainbow matchings

DOI10.1016/j.jcta.2022.105700zbMath1505.05055arXiv2004.12561OpenAlexW4312053972MaRDI QIDQ2680820

Yan Wang, Xingxing Yu, Hongliang Lu

Publication date: 4 January 2023

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

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

zbMATH Keywords

hypergraphsrainbow matchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products

Cites Work

• Unnamed Item
• 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
• Rainbow matchings for 3-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• On Erdős' extremal problem on matchings in hypergraphs
• The Size of a Hypergraph and its Matching Number
• Nearly Perfect Matchings in Uniform Hypergraphs
• Simple juntas for shifted families
• Independent sets in hypergraphs
• Hypercontractivity for global functions and sharp thresholds

This page was built for publication: A better bound on the size of rainbow matchings