Families of finite sets with minimum shadows (Q1100465)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Families of finite sets with minimum shadows |
scientific article; zbMATH DE number 4043846 |
Statements
Families of finite sets with minimum shadows (English)
0 references
1986
0 references
The summary of the authors: ``The following problem was answered by a theorem of Kruskal, Katona, and Lindström about 20 years ago: Given a family of k-element sets \(F,| F| =m\), at least how many (k-d)- element subsets are contained in the members of F? This paper deals with the extremal families, e.g., they are completely described for infinitely many values of m.''
0 references
subsets
0 references
extremal families
0 references
0.8339589834213257
0 references
0.8228613138198853
0 references
0.8096513152122498
0 references
0.8036417365074158
0 references
0.8022260069847107
0 references