Excluded subposets in the Boolean lattice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Excluded subposets in the Boolean lattice

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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

TDS-MACS
66 Consultations
530 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More