Cross-intersecting pairs of hypergraphs

DOI10.1016/j.jcta.2016.12.002zbMath1355.05176arXiv1605.06387OpenAlexW2963720797MaRDI QIDQ507820

Ron Aharoni, David M. Howard

Publication date: 9 February 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremrainbow matchings\(r\)-partite hypergaphscross-intersecting hypergraphs

Mathematics Subject Classification ID

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

Related Items

On Rainbow Matchings for Hypergraphs, A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Shadows and shifting
• Extremal problems for finite sets and convex hulls---a survey
• Erdős-Ko-Rado from Kruskal-Katona
• On cross \(t\)-intersecting families of sets
• Cross-intersecting families of vectors
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• The maximum product of weights of cross-intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• Shadows of colored complexes.
• A new generalization of the Erdős-Ko-Rado theorem