Geodesic
A bound for size Ramsey numbers of multipartite graphs
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is shown that the (diagonal) size Ramsey numbers of complete $m$-partite graphs $K_{m}(n)$ can be bounded from below by $cn^22^{(m-1)n}$, where $c$ is a positive constant.
DOI : 10.37236/1012
Classification : 05C55 
@article{10_37236_1012,
     author = {Yuqin Sun and Yusheng Li},
     title = {A bound for size {Ramsey} numbers of multipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1012},
     zbl = {1123.05062},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1012/}
}
TY  - JOUR
AU  - Yuqin Sun
AU  - Yusheng Li
TI  - A bound for size Ramsey numbers of multipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1012/
DO  - 10.37236/1012
ID  - 10_37236_1012
ER  - 
%0 Journal Article
%A Yuqin Sun
%A Yusheng Li
%T A bound for size Ramsey numbers of multipartite graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1012/
%R 10.37236/1012
%F 10_37236_1012
Yuqin Sun; Yusheng Li. A bound for size Ramsey numbers of multipartite graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1012

Cité par Sources :