Intersecting families of sets are typically trivial
From MaRDI portal
Publication:6144393
DOI10.1016/j.jctb.2023.09.002arXiv2104.03260OpenAlexW3143193920MaRDI QIDQ6144393
Ramon I. Garcia, József Balogh, Lina Li, Adam Zsolt Wagner
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03260
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraph containers
- On the ratio of optimal integral and fractional covers
- Two combinatorial covering theorems
- Independent sets in the middle two layers of Boolean lattice
- Intersecting families of discrete structures are typically trivial
- Structure and supersaturation for intersecting families
- The number of maximal independent sets in the Hamming cube
- Removal and Stability for Erdös--Ko--Rado
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Counting Intersecting and Pairs of Cross-Intersecting Families
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Independent sets in the hypercube revisited
- Independent sets in hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Dedekind's Problem: The Number of Monotone Boolean Functions
This page was built for publication: Intersecting families of sets are typically trivial
