Title
Largest Families Without an -Fork
Abstract
Let [n] = { 1,2,...,n} be a finite set, a family of its subsets, 2 ≤ r a fixed integer. Suppose that contains no r + 1 distinct members F, G 1,..., G r such that F ⊂ G 1,...,F ⊂ G r all hold. The maximum size is asymptotically determined up to the second term, improving the result of Tran.
Year
DOI
Venue
2007
https://doi.org/10.1007/s11083-007-9067-z
Order
Keywords
Field
DocType
Extremal problem for families,Sperner type theorem,Extremal set theory,Fork
Integer,Discrete mathematics,Combinatorics,Finite set,Mathematics
Journal
Volume
Issue
ISSN
24
3
0167-8094
Citations 
PageRank 
References 
24
2.73
2
Authors
2
Name
Order
Citations
PageRank
Annalisa De Bonis134732.27
Gyula O. H. Katona226466.44