Compressions and Probably Intersecting Families
From MaRDI portal
Publication:2883868
DOI10.1017/S0963548311000472zbMath1242.05266arXiv1108.3207OpenAlexW2112422744MaRDI QIDQ2883868
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3207
Related Items (7)
Most Probably Intersecting Families of Subsets ⋮ Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Set Systems Containing Many Maximal Chains ⋮ Probably Intersecting Families are Not Nested ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Most probably intersecting hypergraphs
Cites Work
- Katona's intersection theorem: four proofs
- Compressions and isoperimetric inequalities
- A short proof for a theorem of Harper about Hamming-spheres
- A simple proof of the Kruskal-Katona theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- On separating systems of a finite set
This page was built for publication: Compressions and Probably Intersecting Families