Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JGT
2008

favoriteEmaildiscussreport

92views more JGT 2008»

A new upper bound for the bipartite Ramsey problem

13 years 4 months ago

A new upper bound for the bipartite Ramsey problem

Download www.dpmms.cam.ac.uk

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

David Conlon

Real-time Traffic

Complete Graph | JGT 2008 | Large | Late Seventies |

claim paper

Related Content

» New upper bound formulas with parameters for Ramsey numbers

» New Upper Bounds for Ramsey Numbers

» A note on Ramsey numbers with two parameters

» Online Ramsey games for triangles in random graphs

» Monomulti bipartite Ramsey numbers designs and matrices

» A New Algorithm for Online Coloring Bipartite Graphs

» Ggraphs for the cage problem a new upper bound

» Simulating independence new constructions of condensers ramsey graphs dispersers and extra...

» Star forests dominating sets and Ramseytype problems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JGT
Authors	David Conlon

Comments (0)