Pages that link to "Item:Q5366951"
From MaRDI portal
The following pages link to A Rainbow <i>r</i>-Partite Version of the Erdős–Ko–Rado Theorem (Q5366951):
Displaying 16 items.
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
- Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- On a rainbow version of Dirac's theorem (Q3300090) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- Rainbow matchings in k‐partite hypergraphs (Q4996918) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)
- Rainbow structures in a collection of graphs with degree conditions (Q6094031) (← links)
- On a rainbow extremal problem for color‐critical graphs (Q6119226) (← links)