Erdős-Ko-Rado-type theorems for colored sets
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
An Erdős-Ko-Rado-type theorem was established by Bollobás and Leader for $q$-signed sets and by Ku and Leader for partial permutations. In this paper, we establish an LYM-type inequality for partial permutations, and prove Ku and Leader's conjecture on maximal $k$-uniform intersecting families of partial permutations. Similar results on general colored sets are presented.
DOI : 10.37236/920
Classification : 05D05
Mots-clés : LYM-type inequality, partial permutations
Yu-Shuang Li; Jun Wang. Erdős-Ko-Rado-type theorems for colored sets. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/920
@article{10_37236_920,
     author = {Yu-Shuang Li and Jun Wang},
     title = {Erd\H{o}s-Ko-Rado-type theorems for colored sets},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/920},
     zbl = {1111.05094},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/920/}
}
TY  - JOUR
AU  - Yu-Shuang Li
AU  - Jun Wang
TI  - Erdős-Ko-Rado-type theorems for colored sets
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/920/
DO  - 10.37236/920
ID  - 10_37236_920
ER  - 
%0 Journal Article
%A Yu-Shuang Li
%A Jun Wang
%T Erdős-Ko-Rado-type theorems for colored sets
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/920/
%R 10.37236/920
%F 10_37236_920

Cité par Sources :