Title
Largest family without A ∪ B ⊆ C ∩ D
Abstract
Let F be a family of subsets of an n-element set not containing four distinct members such that A ∪ B ⊆ C ∩ D. It is proved that the maximum size of F under this condition is equal to the sum of the two largest binomial coefficients of order n. The maximum families are also characterized. A LYM-type inequality for such families is given, too.
Year
DOI
Venue
2005
10.1016/j.jcta.2005.01.002
Journal of Combinatorial Theory Series A
Keywords
DocType
Volume
families of subsets,order n,distinct member,maximum family,sperner,lym-type inequality,lym,largest family,maximum size,largest binomial coefficient,binomial coefficient
Journal
111
Issue
ISSN
Citations 
2
J. Combin. Theory Ser. A 111 (2005), no. 2, 331--336
15
PageRank 
References 
Authors
2.67
0
3
Name
Order
Citations
PageRank
Annalisa De Bonis134732.27
Gyula O. H. Katona226466.44
Konrad J. Swanepoel3308.66