Rainbow matchings in k‐partite hypergraphs

DOI10.1112/BLMS.12423zbMath1467.05180arXiv2001.02181OpenAlexW3102052127MaRDI QIDQ4996918

Sergei Kiselev, Andrey B. Kupavskii

Publication date: 2 July 2021

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

rainbow matching\(k\)-uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Rainbow version of the Erdős Matching Conjecture via concentration ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Explicit construction of linear sized tolerant networks
• Proof of the Erdős matching conjecture in a new range
• The Size of a Hypergraph and its Matching Number
• Concentration Inequalities and Martingale Inequalities: A Survey
• On Rainbow Matchings for Hypergraphs
• Simple juntas for shifted families
• A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem

This page was built for publication: Rainbow matchings in k‐partite hypergraphs