Asymptotic bounds for bipartite Ramsey numbers (Q5928525)

The bipartite Ramsey number \(b(m,n)\) is the smallest positive integer \(r\) such that every 2-colouring of the edges of \(K_{r,r}\) contains either a \(K_{m,m}\) whose edges are all coloured in the first colour, or a \(K_{n,n}\) whose edges are all coloured in the second colour, or both. Theorem 1. Let \(m\geq 2\) be fixed. Then there exist constants \(A\) and \(B\) such that \[ A\left(\frac{n}{\log n}\right)^{\frac{m+1}2}<b(m,n)<B\left(\frac{n}{\log n}\right)^m. \]