Abstract
In this note we show how to extend Mathon’s cyclotomic colorings of the edges of some complete graphs without increasing the maximum order of monochromatic complete subgraphs. This improves the well known lower bound construction for multicolor Ramsey numbers, in particular we obtain R3(7) ≥ 3214.
Publication Date
2009
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
Electronic Journal of Combinatorics, 16(1) (2009) #N1
Campus
RIT – Main Campus
COinS
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.