Geodesic
Set families with a forbidden subposet
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We asymptotically determine the size of the largest family $\cal F$ of subsets of $\{1,\dots,n\}$ not containing a given poset $P$ if the Hasse diagram of $P$ is a tree. This is a qualitative generalization of several known results including Sperner's theorem.
DOI : 10.37236/231
Classification : 06A07, 05D05 
@article{10_37236_231,
     author = {Boris Bukh},
     title = {Set families with a forbidden subposet},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/231},
     zbl = {1190.06004},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/231/}
}
TY  - JOUR
AU  - Boris Bukh
TI  - Set families with a forbidden subposet
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/231/
DO  - 10.37236/231
ID  - 10_37236_231
ER  - 
%0 Journal Article
%A Boris Bukh
%T Set families with a forbidden subposet
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/231/
%R 10.37236/231
%F 10_37236_231
Boris Bukh. Set families with a forbidden subposet. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/231

Cité par Sources :