A new upper bound for the bipartite Ramsey problem

We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In the late seventies, Irving [5] showed that it was sufficient, for k large, that n 2k-1

• Type: Journal
• Year: 2008
• Where: JGT
• Authors: David Conlon
• Keywords: Complete Graph, JGT 2008, Large, Late Seventies