Skip to main content
Log in

New lower bounds of classical Ramsey numbersR(6, 12),R(6, 14) andR(6, 15)

  • Bulletin
  • Published:
Chinese Science Bulletin

Abstract

Three new cyclic graphs are constructed by using a computer, and the lower bounds of three Ramsey numbers obtained:R(6,12) ⩾ 224,R(6,14) ⩾ 258,R(6,15) ⩾ 338, which fill in three blanks in the table of bounds of Ramsey numbers.

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,The Electronic Journal of Combinatorics, 1994, 1: 1.

    Google Scholar 

  2. Kalbfleisch, J. G., Chromatic graph and Ramsey’s theorem.Ph. D. thesis, University of Waterloo, January, 1996.

  3. Huag Yiru, Some properties of Ramsey graphs.Journal of Shanghai University (in Chinese). 1995, l(3): 237.

    Google Scholar 

  4. Su Wenlong, Luo Haipeng, Li Qiao, New lower bounds of classiccal Ramsey numbersR (4. 12).R (5.11) and R(5,12).Chinese Science Bulletin, 1997, 42(21):

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Luo, H., Su, W. & Li, Q. New lower bounds of classical Ramsey numbersR(6, 12),R(6, 14) andR(6, 15). Chin. Sci. Bull. 43, 817–818 (1998). https://doi.org/10.1007/BF03182742

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation