Geodesic
A note on odd cycle-complete graph Ramsey numbers
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The Ramsey number $r(C_l, K_n)$ is the smallest positive integer $m$ such that every graph of order $m$ contains either cycle of length $l$ or a set of $n$ independent vertices. In this short note we slightly improve the best known upper bound on $r(C_l, K_n)$ for odd $l$.
DOI : 10.37236/1662
Classification : 05D10, 05C69, 05C38
Mots-clés : Ramsey number 
@article{10_37236_1662,
     author = {Benny Sudakov},
     title = {A note on odd cycle-complete graph {Ramsey} numbers},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1662},
     zbl = {0981.05098},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1662/}
}
TY  - JOUR
AU  - Benny Sudakov
TI  - A note on odd cycle-complete graph Ramsey numbers
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1662/
DO  - 10.37236/1662
ID  - 10_37236_1662
ER  - 
%0 Journal Article
%A Benny Sudakov
%T A note on odd cycle-complete graph Ramsey numbers
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1662/
%R 10.37236/1662
%F 10_37236_1662
Benny Sudakov. A note on odd cycle-complete graph Ramsey numbers. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1662

Cité par Sources :