The maximum number of disjoint pairs in a family of subsets

DOI10.1007/BF02582924zbMath0579.05002OpenAlexW2052907214MaRDI QIDQ1066898

Peter Frankl, Noga Alon

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582924

zbMATH Keywords

family of subsetsErdős-Stone type resultnumber of disjoint pairs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (5)

Set Systems Containing Many Maximal Chains ⋮ Generating all subsets of a finite set with disjoint unions ⋮ Comparable pairs in families of sets ⋮ Disjoint pairs in set systems with restricted intersection ⋮ The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• On Kruskal's cascades and counting containments in a set of subsets
• On the Structure of Edge Graphs II

This page was built for publication: The maximum number of disjoint pairs in a family of subsets