Enumeration of intersecting families

DOI10.1016/0012-365X(84)90130-4zbMath0529.05044OpenAlexW2023137323WikidataQ105675463 ScholiaQ105675463MaRDI QIDQ787169

Paul Erdős, Neil Hindman

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90130-4

zbMATH Keywords

Boolean functionsmaximal intersecting familiesnumber of Sperner systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (6)

Maximal intersecting families ⋮ Finite algebras with large free spectra ⋮ Maximal independent sets in the covering graph of the cube ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ On the structure of minimal winning coalitions in simple voting games ⋮ Coloring graphs with locally few colors

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: Enumeration of intersecting families