Largest family without A ∪ B ⊆ C ∩ D

No Thumbnail Available

Authors

De Bonis A.
Katona G.O.H.
Swanepoel K.J.

Issue Date

2005

Type

Article

Language

en

Keywords

Families of subsets; LYM; Sperner

Research Projects

Organizational Units

Journal Issue

Alternative Title

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. © 2005 Elsevier Inc. All rights reserved.

Description

Citation

Journal of Combinatorial Theory. Series A
111
2

Publisher

License

Journal

Volume

Issue

PubMed ID

DOI

ISSN

973165

EISSN

Collections