Excluded subposets in the Boolean lattice
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2005_special_250_a18,
     author = {Katona, Gyula O.H.},
     title = {Excluded subposets in the {Boolean} lattice},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3409},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3409/}
}
TY  - JOUR
AU  - Katona, Gyula O.H.
TI  - Excluded subposets in the Boolean lattice
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3409/
DO  - 10.46298/dmtcs.3409
LA  - en
ID  - DMTCS_2005_special_250_a18
ER  - 
%0 Journal Article
%A Katona, Gyula O.H.
%T Excluded subposets in the Boolean lattice
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3409/
%R 10.46298/dmtcs.3409
%G en
%F DMTCS_2005_special_250_a18
Katona, Gyula O.H. Excluded subposets in the Boolean lattice. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3409. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3409/

Cité par Sources :