On Rainbow Matchings for Hypergraphs

DOI10.1137/16M1102380zbMath1379.05090arXiv1611.01735OpenAlexW2962924047MaRDI QIDQ4602861

Xingxing Yu, Hongliang Lu

Publication date: 7 February 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchingrainbow matching\(k\)-uniform hypergraphs

Mathematics Subject Classification ID

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

Related Items (3)

Rainbow spanning structures in graph and hypergraph systems ⋮ Simple juntas for shifted families ⋮ Rainbow matchings in k‐partite 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
• Cross-intersecting pairs of hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On Erdős' extremal problem on matchings in hypergraphs
• The Size of a Hypergraph and its Matching Number
• A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: On Rainbow Matchings for Hypergraphs