Abstract
A method is put forward to establish the lower bounds for somen-color classical Ramsey numbers
. With this method six new explicit lower boundsR 4(4) ≥458,R 3(5) ≥ 242,R 3(6)≥1070,R 3(7) ≥ 1214,R 3(8) ≥2834 andR 3(9) ≥ 5282 are obtained using a computer.
Similar content being viewed by others
References
Radziszowski, S, P., Small Ramsey numbers,Electronic J. Combinatoricc, 1998, 5:1.
Biggs, N.,Algebraic Graph Theory, Cambridge: Cambridge University F’ress, 1974.
Calkin, N. J., Erdos, P., Tovey, C. A., New Ramsey bounds from cyclic graphs of prime order,SIAM J. Discrete Math., 1997,10:381.
Su Wenlong, Luo Haipeng, Li Qiao, New lower bounds of classical Ramsey numbersR(4,12),R(5,11) andR(5,12),Chinese Science Bulletin, 1997, 42(22): 2460.
Author information
Authors and Affiliations
Additional information
Project supported by Guangxi Natural Science Foundation
Rights and permissions
About this article
Cite this article
Su, W., Luo, H. & Li, Q. Lower bounds for multicolor classical Ramsey numbers . Sci. China Ser. A-Math. 42, 1019–1024 (1999). https://doi.org/10.1007/BF02889502
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02889502