Sharp results concerning disjoint cross-intersecting families
From MaRDI portal
Publication:1987086
DOI10.1016/j.ejc.2020.103089zbMath1437.05230arXiv1905.08123OpenAlexW3007603958MaRDI QIDQ1987086
Andrey B. Kupavskii, Peter Frankl
Publication date: 9 April 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.08123
Related Items (6)
On Erd\H{o}s Chains in the Plane ⋮ A refined result on cross-intersecting families ⋮ Diversity ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ Degree versions of theorems on intersecting families via stability ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new short proof of the EKR theorem
- A size-sensitive inequality for cross-intersecting families
- Non-trivial intersecting families
- A generalization of a theorem of Kruskal
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Two extremal problems on intersecting families
- Regular bipartite graphs and intersecting families
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- Erdős-Ko-Rado from Kruskal-Katona
- Degree versions of theorems on intersecting families via stability
- A simple proof of the Erdős-Chao Ko-Rado theorem
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A new generalization of the Erdős-Ko-Rado theorem
- Diversity
This page was built for publication: Sharp results concerning disjoint cross-intersecting families
