Intersecting families with minimum volume

DOI10.1016/S0012-365X(02)00439-9MaRDI QIDQ1850022zbMATH OpenOpenAlexFDO

Authors J. Griggs

Publication date 2 December 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00439-9

zbMATH Keywords

average set sizeintersecting families of setslinear program

Mathematics Subject Classification ID

Extremal set theory (05D05) Linear programming (90C05)

Review text

The paper determines the minimum volume (= sum of cardinalities) of an intersecting family of subsets of an \(n\)-element underlying set, which provides a lower bound on the average size of sets in an intersecting family. This answers a problem of G. O. H. Katona. The proof is based on a simple linear program.

Recommendations

• Some exact results for multiply intersecting families
• On the union of intersecting families
• On the average size of sets in intersecting Sperner families
• Intersecting balanced families of sets
• On shadows of intersecting families

Cited in

(1)

• On the average size of sets in intersecting Sperner families

This page was built for publication: Intersecting families with minimum volume

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850022)