
doi: 10.37236/1561
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$.
Extremal problems in graph theory, Ramsey number, Generalized Ramsey theory, bounds
Extremal problems in graph theory, Ramsey number, Generalized Ramsey theory, bounds
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
