Skip to main content
Log in

Lower bounds for multicolor classical Ramsey numbers

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Radziszowski, S, P., Small Ramsey numbers,Electronic J. Combinatoricc, 1998, 5:1.

    MathSciNet  Google Scholar 

  2. Biggs, N.,Algebraic Graph Theory, Cambridge: Cambridge University F’ress, 1974.

    MATH  Google Scholar 

  3. Calkin, N. J., Erdos, P., Tovey, C. A., New Ramsey bounds from cyclic graphs of prime order,SIAM J. Discrete Math., 1997,10:381.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Project supported by Guangxi Natural Science Foundation

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02889502

Keywords

Navigation