×

Bipartite Ramsey theorems for multiple copies of \(K_{2,2}\). (English) Zbl 0918.05075

For a bipartite graph \(G\), the bipartite Ramsey number \(b(G)\) is the smallest positive integer \(b\) such that any \(2\)-coloring of the edges of the complete biparite graph \(K_{b,b}\) contains a monochromatic copy of \(G\). Using degree and counting techniques, it is shown that \(r(nK_{2,2}) = 4n - 1\) for \(n \geq 2\).

MSC:

05C55 Generalized Ramsey theory
PDFBibTeX XMLCite