New lower bound for multicolor Ramsey numbers for even cycles
The electronic journal of combinatorics, Tome 12 (2005)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
For given finite family of graphs $G_{1}, G_{2}, \ldots , G_{k}, k \geq 2$, the multicolor Ramsey number $R(G_{1}, G_{2}, \ldots , G_{k})$ is the smallest integer $n$ such that if we arbitrarily color the edges of the complete graph on $n$ vertices with $k$ colors then there is always a monochromatic copy of $G_{i}$ colored with $i$, for some $1 \leq i \leq k$. We give a lower bound for $k-$color Ramsey number $R(C_{m}, C_{m}, \ldots , C_{m})$, where $m \geq 4$ is even and $C_{m}$ is the cycle on $m$ vertices.
Tomasz Dzido; Andrzej Nowik; Piotr Szuca. New lower bound for multicolor Ramsey numbers for even cycles. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1980
@article{10_37236_1980,
author = {Tomasz Dzido and Andrzej Nowik and Piotr Szuca},
title = {New lower bound for multicolor {Ramsey} numbers for even cycles},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1980},
zbl = {1080.05062},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1980/}
}
Cité par Sources :