Geodesic
Traces without maximal chains
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The trace of a family of sets ${\cal A}$ on a set $X$ is ${\cal A}|_X=\{A\cap X:A\in {\cal A}\}$. If ${\cal A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace ${\cal A}|_X$ does not contain a maximal chain, then how large can ${\cal A}$ be? Patkós conjectured that, for $n$ sufficiently large, the size of ${\cal A}$ is at most ${n-k+r-1\choose r-1}$. Our aim in this paper is to prove this conjecture.
DOI : 10.37236/465
Classification : 05D05 
@article{10_37236_465,
     author = {Ta Sheng Tan},
     title = {Traces without maximal chains},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/465},
     zbl = {1205.05234},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/465/}
}
TY  - JOUR
AU  - Ta Sheng Tan
TI  - Traces without maximal chains
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/465/
DO  - 10.37236/465
ID  - 10_37236_465
ER  - 
%0 Journal Article
%A Ta Sheng Tan
%T Traces without maximal chains
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/465/
%R 10.37236/465
%F 10_37236_465
Ta Sheng Tan. Traces without maximal chains. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/465

Cité par Sources :