Intersecting families with minimum volume (Q1850022)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Intersecting families with minimum volume |
scientific article; zbMATH DE number 1839002
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intersecting families with minimum volume |
scientific article; zbMATH DE number 1839002 |
Statements
Intersecting families with minimum volume (English)
0 references
2 December 2002
0 references
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.
0 references
intersecting families of sets
0 references
average set size
0 references
linear program
0 references
