Abstract
By an edge-coloring induced by generalization of Paley graph and computer searching, we show that that Ramsey numbers of K n − e in three colors for n = 6, 7, 8, 9 are at least 472, 1102, 3208, 5962, respectively.
Similar content being viewed by others
References
Dong L., Li Y.: A constuction for Ramsey number for K m,n . Eur. J. Combin. 31, 1667–1670 (2010)
Graham R., Rothschild B., Spencer J.: Ramsey Theory. Wiley, New York (1990)
Mathon R.: Lower bounds for Ramsey numbers and association schemes. J. Combin. Theory Ser. B 42, 122–127 (1987)
Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Combin. DS1.9. http://www.combinatorics.org/ (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
He, C., Li, Y. & Dong, L. Three-Color Ramsey Numbers of K n Dropping an Edge. Graphs and Combinatorics 28, 663–669 (2012). https://doi.org/10.1007/s00373-011-1069-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1069-3