Three-Color Ramsey Numbers of K n Dropping an Edge | Graphs and Combinatorics Skip to main content
Log in

Three-Color Ramsey Numbers of K n Dropping an Edge

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

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

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dong L., Li Y.: A constuction for Ramsey number for K m,n . Eur. J. Combin. 31, 1667–1670 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Graham R., Rothschild B., Spencer J.: Ramsey Theory. Wiley, New York (1990)

    MATH  Google Scholar 

  3. Mathon R.: Lower bounds for Ramsey numbers and association schemes. J. Combin. Theory Ser. B 42, 122–127 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Combin. DS1.9. http://www.combinatorics.org/ (2009)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lin Dong.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-011-1069-3

Keywords

Navigation