Largest family without A boolean OR B subset of C boolean AND D

TitleLargest family without A boolean OR B subset of C boolean AND D
Publication TypeJournal Article
AuthorsDe Bonis, A., G. O. H. Katona, and K. J. Swanepoel
Journal titleJournal of Combinatorial Theory Series A
Year2005
Pages331 - 336
Volume111
Issue2
Abstract

Let F be a family of subsets of an n-element set not containing four distinct members such that A boolean OR B subset of C boolean AND 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. (c) 2005 Elsevier Inc. All rights reserved.

Languageeng
Notes

Aug; Largest family without A boolean OR B subset of C boolean AND D

Publisher linkhttp://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6WHS-4FM0192-1-5&_cdi=6858&_user=7105836&_orig=browse&_coverDate=08%2F31%2F2005&_sk=998889997&view=c&wchp=dGLzVlz-zSkWA&md5=40f4aeb7cc4c163601a6b166dc44ef63&ie=/sdarticle.pdf