Set systems with few disjoint pairs

DOI10.1007/s00493-003-0033-0zbMath1045.05083OpenAlexW1985046307WikidataQ105584600 ScholiaQ105584600MaRDI QIDQ1878795

Imre Leader, Béla Bollobás

Publication date: 8 September 2004

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-003-0033-0

zbMATH Keywords

Erdős-Ko-Rado theoremKneser graphintersecting familiesfractional set system

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (10)

Structure and supersaturation for intersecting families ⋮ A short note on supersaturation for oddtown and eventown ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ Discrete norms of a matrix and the converse to the expander mixing lemma ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ A note on supersaturated set systems ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Fractional set systems with few disjoint pairs ⋮ Most probably intersecting hypergraphs

This page was built for publication: Set systems with few disjoint pairs