A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
From MaRDI portal
Publication:5366951
DOI10.1017/S0963548316000353zbMath1371.05195arXiv1605.06752OpenAlexW2963988834MaRDI QIDQ5366951
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.06752
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (16)
Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ 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 ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ On a rainbow extremal problem for color‐critical graphs ⋮ On Rainbow Matchings for Hypergraphs ⋮ On a rainbow version of Dirac's theorem ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ Rainbow matchings in k‐partite hypergraphs ⋮ On the size of the product of overlapping families ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs
Cites Work
- Cross-intersecting pairs of hypergraphs
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Matchings and covers in hypergraphs
- The Size of a Hypergraph and its Matching Number
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the size of graphs with complete-factors
- A new generalization of the Erdős-Ko-Rado theorem
- Unnamed Item
- Unnamed Item
This page was built for publication: A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
