Asymptotic bounds for bipartite Ramsey numbers
The electronic journal of combinatorics, Tome 8 (2001) no. 1
The bipartite Ramsey number $b(m,n)$ is the smallest positive integer $r$ such that every (red, green) coloring of the edges of $K_{r,r}$ contains either a red $K_{m,m}$ or a green $K_{n,n}$. We obtain asymptotic bounds for $b(m,n)$ for $m \geq 2$ fixed and $n \rightarrow \infty$.
@article{10_37236_1561,
author = {Yair Caro and Cecil Rousseau},
title = {Asymptotic bounds for bipartite {Ramsey} numbers},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {1},
doi = {10.37236/1561},
zbl = {0964.05044},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1561/}
}
Yair Caro; Cecil Rousseau. Asymptotic bounds for bipartite Ramsey numbers. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1561
Cité par Sources :