Cross-intersecting families of finite sets
From MaRDI portal
Publication:1903016
DOI10.1016/0097-3165(95)90072-1zbMath0839.05092OpenAlexW2076669108MaRDI QIDQ1903016
Publication date: 18 June 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90072-1
Related Items (6)
The order dimension of two levels of the Boolean lattices ⋮ Almost cross-intersecting and almost cross-Sperner pairs of families of sets ⋮ Improved bounds for cross-Sperner systems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Intersecting Families are Essentially Contained in Juntas ⋮ On the bandwidth of the Kneser graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Extremal problems concerning Kneser-graphs
- Non-trivial intersecting families
- Some best possible inequalities concerning cross-intersecting families
- Extremal problems for finite sets and convex hulls---a survey
- A bipartite Erdős-Ko-Rado theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: Cross-intersecting families of finite sets