Skip navigation
Skip navigation

Ramsey numbers for triangles versus almost-complete graphs

McKay, Brendan; Piwakowski, Konrad; Radziszowski, Stanislaw


We show that, in any coloring of the edges of K38 with two colors, there exists a triangle in the first color or a monochromatic K 10-e (K10 with one edge removed) in the second color, and hence we obtain a bound on the corresponding Ramsey number, R(K 3,K10-e) ≤ 38. The new lower bound of 37 for this number is established by a coloring of K36 avoiding triangles in the first color and K10-e in the second color. This improves by one the best previously known lower and upper bounds. We also give...[Show more]

CollectionsANU Research Publications
Date published: 2004
Type: Journal article
Source: Ars Combinatoria


File Description SizeFormat Image
01_McKay_Ramsey_numbers_for_triangles_2004.pdf150.34 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator