Skip to Main content Skip to Navigation
Conference papers

Excluded subposets in the Boolean lattice

Abstract : We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying $A ⊂B, C ⊂B, C ⊂D$. It is proved that this number is at least the number of the $\lfloor \frac{n }{ 2}\rfloor$ -element sets times $1+\frac{2}{ n}$, on the other hand an upper bound is given with 4 replaced by the value 2.
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184366
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:37:42 AM
Last modification on : Tuesday, November 26, 2019 - 4:12:08 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:01:45 AM

File

dmAE0145.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Gyula O.H. Katona. Excluded subposets in the Boolean lattice. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.229-230, ⟨10.46298/dmtcs.3409⟩. ⟨hal-01184366⟩

Share

Metrics

Record views

67

Files downloads

408