On the minimum number of disjoint pairs in a family of finite sets

DOI10.1016/0097-3165(77)90056-5zbMath0363.05010OpenAlexW2069301864WikidataQ105583671 ScholiaQ105583671MaRDI QIDQ1240245

Peter Frankl

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90056-5

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20)

Related Items (8)

Applications of graph containers in the Boolean lattice ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ A note on supersaturated set systems ⋮ Probably Intersecting Families are Not Nested ⋮ 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

Cites Work

• Unnamed Item

This page was built for publication: On the minimum number of disjoint pairs in a family of finite sets