How many colors guarantee a rainbow matching?

zbMath1300.05097arXiv1211.0793MaRDI QIDQ405108

Tibor Szabó, Roman Glebov, Benjamin Sudakov

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal problemsrainbow matching

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) Transversal (matching) theory (05D15)

Related Items (8)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ All group‐based latin squares possess near transversals ⋮ Rainbow matchings and algebras of sets ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ Flattening rank and its combinatorial applications ⋮ Quadratic vertex kernel for rainbow matching ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs ⋮ Choice functions in the intersection of matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Multicolored matchings in hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• A condition for matchability in hypergraphs
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Large Rainbow Matchings in Edge-Coloured Graphs
• The Size of a Hypergraph and its Matching Number
• Rainbow Turán Problems
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Hall's theorem for hypergraphs
• A Combinatorial Theorem
• An anti-Ramsey theorem

This page was built for publication: How many colors guarantee a rainbow matching?