Families of finite sets with minimum shadows (Q1100465): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zoltan Fueredi / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: B. Andrasfai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new short proof for the Kruskal-Katona theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Kruskal / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579261 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972612624 / rank
 
Normal rank

Latest revision as of 09:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Families of finite sets with minimum shadows
scientific article

    Statements

    Families of finite sets with minimum shadows (English)
    0 references
    0 references
    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 references

    Identifiers