Geodesic
The intersection structure of \(t\)-intersecting families
The electronic journal of combinatorics, Tome 12 (2005)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A family of sets is $t$-intersecting if any two sets from the family contain at least $t$ common elements. Given a $t$-intersecting family of $r$-sets from an $n$-set, how many distinct sets of size $k$ can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved. This result can be seen as a generalization of the Erdős-Ko-Rado theorem.
DOI : 10.37236/1985
Classification : 05D05, 05C65
Mots-clés : \(t\)-intersecting system, Erdős-Ko-Rado theorem 
@article{10_37236_1985,
     author = {John Talbot},
     title = {The intersection structure of \(t\)-intersecting families},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1985},
     zbl = {1074.05086},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1985/}
}
TY  - JOUR
AU  - John Talbot
TI  - The intersection structure of \(t\)-intersecting families
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1985/
DO  - 10.37236/1985
ID  - 10_37236_1985
ER  - 
%0 Journal Article
%A John Talbot
%T The intersection structure of \(t\)-intersecting families
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1985/
%R 10.37236/1985
%F 10_37236_1985
John Talbot. The intersection structure of \(t\)-intersecting families. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1985

Cité par Sources :