Excluded subposets in the Boolean lattice - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAE0145.pdf (125.74 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184366 , version 1 (14-08-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
66 View
493 Download

Altmetric

Share

Gmail Facebook X LinkedIn More