Bounds on some Ramsey numbers involving quadrilateral

Show full item record

Title: Bounds on some Ramsey numbers involving quadrilateral
Author: Xu, Xiaodong; Shao, Zehui; Radziszowski, Stanislaw
Abstract: For graphs G_1,G_2,...,G_m the Ramsey number R(G_1,G_2,...,G_m) is defined to be the smallest integer n such that any m-coloring of the edges of the complete graph K_n must include a monochromatic G_i in color i, for some i. In this note we establish several lower and upper bounds for some Ramsey numbers involving quadrilateral C_4, including R(C_4,K_9) <= 32, 19 <= R(C_4,C_4,K_4) <= 22, 31 <= R(C_4,C_4,C_4,K_4) <= 50, 52 <= R(C_4,K_4,K_4) <= 72, 42 <= R(C_4,C_4,K_3,K_4) <= 76, and 87 <= (C_4,C_4,K_4,K_4) <= 179.
Record URI: http://hdl.handle.net/1850/9134
Date: 2009

Files in this item

Files Size Format View
SRadziszowskiArticle01-2009.pdf 89.00Kb PDF View/Open
SRadziszowskiSlides2009.pdf 173.1Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse