Most Probably Intersecting Families of Subsets

DOI10.1017/S0963548311000587zbMath1241.05144OpenAlexW1973182252MaRDI QIDQ2883864

Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000587

zbMATH Keywords

intersecting familyinclusion-free family

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (8)

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 ⋮ Structure and supersaturation for intersecting families ⋮ Set Systems Containing Many Maximal Chains ⋮ Probably Intersecting Families are Not Nested ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Most probably intersecting hypergraphs

Cites Work

• Compressions and Probably Intersecting Families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of Non-disjoint subsets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Most Probably Intersecting Families of Subsets