Skip to main content
SpringerLink
Log in

Ramsey Numbers Involving Cycles

  • Chapter
  • First Online:
Ramsey Theory

Part of the book series: Progress in Mathematics ((PM,volume 285))

  • 2020 Accesses

Abstract

There is a vast amount of literature on Ramsey-type problems starting in 1930 with the original paper of Ramsey [Ram]. Graham, Rothschild and Spencer in their book, Ramsey Theory [GRS] and Soifer in the 2009 The Mathematical Coloring Book, Mathematics of Coloring and the Colorful Life of Its Creators [Soi] present exciting developments in the history, results and people of Ramsey theory. The subject has grown amazingly, in particular with regard to asymptotic bounds for various types of Ramsey numbers (for example, see the survey papers [GrRö; Neš; ChGra2]), but the progress on evaluating the basic numbers themselves has been very unsatisfactory for a long time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. N. Alon and V. Rödl, Sharp Bounds for Some Multicolor Ramsey Numbers, Combinatorica, 25 (2005) 125–141.

    Article  MathSciNet  MATH  Google Scholar 

  2. F.S. Benevides and J. Skokan, The 3-Colored Ramsey Number of Even Cycles, Journal of Combinatorial Theory, Series B, 99 (2009) 690–708.

    MathSciNet  MATH  Google Scholar 

  3. A. Bialostocki and J. Schönheim, On Some Turán and Ramsey Numbers for C 4, in Graph Theory and Combinatorics, (B. Bollobás ed.), Academic, London, (1984) 29–33.

    Google Scholar 

  4. H. Bielak, Ramsey and 2-local Ramsey Numbers for Disjoint Unions of Cycles, Discrete Mathematics, 307 (2007) 319–330.

    Article  MathSciNet  MATH  Google Scholar 

  5. B. Bollobás, C.J. Jayawardene, Y.J. Sheng, Y.R. Huang, C.C. Rousseau and K.M. Zhang, On a Conjecture Involving Cycle-Complete Graph Ramsey Numbers, Australasian Journal of Combinatorics, 22 (2000) 63–71.

    MathSciNet  MATH  Google Scholar 

  6. J.A. Bondy and P. Erdős, Ramsey Numbers for Cycles in Graphs, Journal of Combinatorial Theory, Series B, 14 (1973) 46–54.

    Google Scholar 

  7. S.A. Burr, Generalized Ramsey Theory for Graphs – A Survey, in Graphs and Combinatorics, (R. Bari and F. Harary eds.), Springer LNM 406, Berlin, (1974) 52–75.

    Google Scholar 

  8. S.A. Burr, What Can We Hope to Accomplish in Generalized Ramsey Theory?, Discrete Mathematics, 67 (1987) 215–225.

    Article  MathSciNet  MATH  Google Scholar 

  9. S.A. Burr and P. Erdős, Generalizations of a Ramsey-Theoretic Result of Chvátal, Journal of Graph Theory, 7 (1983) 39–51.

    Article  MathSciNet  MATH  Google Scholar 

  10. S.A. Burr, P. Erdős, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Ramsey Numbers for the Pair Sparse Graph-Path or Cycle, Transactions of the American Mathematical Society, 269 (1982) 501–512.

    Article  MathSciNet  MATH  Google Scholar 

  11. S.A. Burr, P. Erdős, R.J. Faudree, C.C. Rousseau and R.H. Schelp. Some Complete Bipartite Graph-Tree Ramsey Numbers, Annals of Discrete Mathematics, 41 (1989) 79–89.

    Article  Google Scholar 

  12. S.A. Burr, P. Erdős and J.H. Spencer, Ramsey Theorems for Multiple Copies of Graphs. Transactions of the American Mathematical Society, 209 (1975) 87–99.

    Article  MathSciNet  MATH  Google Scholar 

  13. S.A. Burr and V. Rosta. On the Ramsey Multiplicities of Graphs – Problems and Recent Results, Journal of Graph Theory, 4 (1980) 347–361.

    Article  MathSciNet  MATH  Google Scholar 

  14. L.E. Bush, The William Lowell Putnam Mathematical Competition, American Mathematical Monthly, 60 (1953) 539–542.

    Article  MathSciNet  Google Scholar 

  15. Y. Caro, Y. Li, C.C. Rousseau and Y. Zhang, Asymptotic Bounds for Some Bipartite Graph – Complete Graph Ramsey Numbers, Discrete Mathematics, 220 (2000) 51–56.

    Article  MathSciNet  MATH  Google Scholar 

  16. G. Chartrand, C.C. Rousseau, M.J. Stewart, A.D. Polimeni and J. Sheehan, On Star-Book Ramsey Numbers, in Proceedings of the Fourth International Conference on the Theory and Applications of Graphs, (M.I. Kalamazoo ed. 1980), Wiley, (1981) 203–214.

    Google Scholar 

  17. G. Chartrand and S. Schuster, On the existence of specified cycles in complementary graphs, Bulletin of the American Mathematical Society, 77 (1971) 995–998.

    Article  MathSciNet  MATH  Google Scholar 

  18. Chen Guantao, A Result on C 4-Star Ramsey Numbers, Discrete Mathematics, 163 (1997) 243–246.

    Google Scholar 

  19. Chen Jie, The Lower Bound of Some Ramsey Numbers (in Chinese), Journal of Liaoning Normal University, Natural Science, 25 (2002) 244–246.

    Google Scholar 

  20. Y.J. Chen, T.C. Edwin Cheng and C.T. Ng, A Theorem on Cycle-Wheel Ramsey Number, manuscript, (2009).

    Google Scholar 

  21. Y.J. Chen, T.C. Edwin Cheng and Ran Xu, The Ramsey Number for a Cycle of Length Six versus a Clique of Order Eight, Discrete Applied Mathematics, 157 (2009) 8–12.

    Article  MathSciNet  MATH  Google Scholar 

  22. Y.J. Chen, T.C. Edwin Cheng and Y. Zhang, The Ramsey Numbers R(C m ,K 7) and R(C 7,K 8), European Journal of Combinatorics, 29 (2008) 1337–1352.

    Article  MathSciNet  MATH  Google Scholar 

  23. T.C. Edwin Cheng, Y.J. Chen, Y. Zhang and C.T. Ng, The Ramsey Numbers for a Cycle of Length Six or Seven versus a Clique of Order Seven, Discrete Mathematics, 307 (2007) 1047–1053.

    Article  MathSciNet  MATH  Google Scholar 

  24. F.R.K. Chung, On Triangular and Cyclic Ramsey Numbers with k Colors, in Graphs and Combinatorics, (R. Bari and F. Harary eds.), Springer LNM 406, Berlin, (1974) 236–241.

    Google Scholar 

  25. F.R.K. Chung and R.L. Graham, On Multicolor Ramsey Numbers for Complete Bipartite Graphs, Journal of Combinatorial Theory, Series B, 18 (1975) 164–169.

    MathSciNet  MATH  Google Scholar 

  26. F.R.K. Chung and R.L. Graham, Erdős on Graphs, His Legacy of Unsolved Problems, A K Peters, Wellesley, MA (1998).

    Google Scholar 

  27. V. Chvátal, Tree-Complete Graph Ramsey Numbers, Journal of Graph Theory, 1 (1977) 93.

    Article  MathSciNet  Google Scholar 

  28. V. Chvátal and F. Harary, Generalized Ramsey Theory for Graphs, II. Small Diagonal Numbers, Proceedings of the American Mathematical Society, 32 (1972) 389–394.

    Google Scholar 

  29. V. Chvátal and F. Harary, Generalized Ramsey Theory for Graphs, III. Small Off-Diagonal Numbers, Pacific Journal of Mathematics, 41 (1972) 335–345.

    Google Scholar 

  30. V. Chvátal and A. Schwenk, On the Ramsey Number of the Five-Spoked Wheel, in Graphs and Combinatorics, (R. Bari and F. Harary eds.), Springer LNM 406, Berlin, (1974) 247–261.

    Google Scholar 

  31. M. Clancy, Some Small Ramsey Numbers, Journal of Graph Theory, 1 (1977) 89–91.

    Article  MathSciNet  MATH  Google Scholar 

  32. L. Clark, On Cycle-Star Graph Ramsey Numbers, Congressus Numerantium, 50 (1985) 187–192.

    MathSciNet  Google Scholar 

  33. T. Denley, The Ramsey Numbers for Disjoint Unions of Cycles, Discrete Mathematics, 149 (1996) 31–44.

    Article  MathSciNet  MATH  Google Scholar 

  34. T. Dzido, Ramsey Numbers for Various Graph Classes (in Polish), Ph.D. thesis, University of Gda ńsk, Poland, November 2005.

    Google Scholar 

  35. T. Dzido, Multicolor Ramsey Numbers for Paths and Cycles, Discussiones Mathematicae Graph Theory, 25 (2005) 57–65.

    Article  MathSciNet  MATH  Google Scholar 

  36. T. Dzido and R. Fidytek, On Some Three Color Ramsey Numbers for Paths and Cycles, Discrete Mathematics, 309 (2009) 4955–4958.

    Article  MathSciNet  MATH  Google Scholar 

  37. T. Dzido, M. Kubale and K. Piwakowski, On Some Ramsey and Turán-type Numbers for Paths and Cycles, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R55, 13 (2006), 9 pages.

  38. T. Dzido, A. Nowik and P. Szuca, New Lower Bound for Multicolor Ramsey Numbers for Even Cycles, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #N13, 12 (2005), 5 pages.

  39. P. Erdős, On the Combinatorial Problems Which I Would Most Like to See Solved, Combinatorica, 1 (1981) 25–42.

    Article  MathSciNet  Google Scholar 

  40. P. Erdős, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Generalized Ramsey Theory for Multiple Colors, Journal of Combinatorial Theory, Series B, 20 (1976) 250–264.

    Google Scholar 

  41. P. Erdős, R.J. Faudree, C.C. Rousseau and R.H. Schelp, On Cycle-Complete Graph Ramsey Numbers, Journal of Graph Theory, 2 (1978) 53–64.

    Article  MathSciNet  Google Scholar 

  42. P. Erdős, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Multipartite Graph-Sparse Graph Ramsey Numbers, Combinatorica, 5 (1985) 311–318.

    Article  MathSciNet  Google Scholar 

  43. P. Erdős and R.L. Graham, On Partition Theorems for Finite Sets, in Infinite and Finite Sets, (A. Hajnal, R. Rado and V.T. Sós eds.) Vol. 1, 515–527, Colloq. Math. Soc. Janos Bolyai, Vol. 10, North Holland, 1975.

    Google Scholar 

  44. G. Exoo, Constructing Ramsey Graphs with a Computer, Congressus Numerantium, 59 (1987) 31–36.

    MathSciNet  Google Scholar 

  45. G. Exoo, On Two Classical Ramsey Numbers of the Form R(3, n), SIAM Journal of Discrete Mathematics, 2 (1989) 488–490.

    Google Scholar 

  46. G. Exoo and D.F. Reynolds, Ramsey Numbers Based on C 5-Decompositions, Discrete Mathematics, 71 (1988) 119–127.

    Article  MathSciNet  MATH  Google Scholar 

  47. R.J. Faudree, S.L. Lawrence, T.D. Parsons and R.H. Schelp, Path-Cycle Ramsey Numbers, Discrete Mathematics, 10 (1974) 269–277.

    Article  MathSciNet  MATH  Google Scholar 

  48. R.J. Faudree, C.C. Rousseau and J. Sheehan, More from the Good Book, in Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publ., Congressus Numerantium XXI (1978) 289–299.

    Google Scholar 

  49. R.J. Faudree, C.C. Rousseau and J. Sheehan, Cycle-Book Ramsey Numbers, Ars Combinatoria, 31 (1991) 239–248.

    MathSciNet  MATH  Google Scholar 

  50. R.J. Faudree and R.H. Schelp, All Ramsey Numbers for Cycles in Graphs, Discrete Mathematics, 8 (1974) 313–329.

    Article  MathSciNet  MATH  Google Scholar 

  51. R.J. Faudree and R.H. Schelp, Some Problems in Ramsey Theory, in Theory and Applications of Graphs, (conference proceedings, Kalamazoo, MI 1976), Lecture Notes in Mathematics 642, Springer, Berlin, (1978) 500–515.

    Google Scholar 

  52. R.J. Faudree, R.H. Schelp and M. Simonovits, On Some Ramsey Type Problems Connected with Paths, Cycles and Trees, Ars Combinatoria, 29A (1990) 97–106.

    MathSciNet  MATH  Google Scholar 

  53. R.J. Faudree, A. Schelten and I. Schiermeyer, The Ramsey Number r(C 7,C 7,C 7), Discussiones Mathematicae Graph Theory, 23 (2003) 141–158.

    Article  MathSciNet  MATH  Google Scholar 

  54. A. Figaj and T. Łuczak, The Ramsey Number for a Triple of Long Even Cycles, Journal of Combinatorial Theory, Series B, 97 (2007) 584–596.

    Google Scholar 

  55. A. Figaj and T. Łuczak, The Ramsey Numbers for a Triple of Long Cycles, manuscript, arXiv, http://front.math.ucdavis.edu/0709.0048 (2007).

  56. L. Gerencsér and A. Gyárfás, On Ramsey-Type Problems, Annales Universitatis Scientiarum Budapestinensis, Eötvös Sect. Math., 10 (1967) 167–170.

    Google Scholar 

  57. A. Gonçalves and E.L. Monte Carmelo, Some Geometric Structures and Bounds for Ramsey Numbers, Discrete Mathematics, 280 (2004) 29–38.

    Article  MathSciNet  MATH  Google Scholar 

  58. R.L. Graham and V. Rödl, Numbers in Ramsey Theory, in Surveys in Combinatorics, (C. Whitehead ed.), Cambridge University Press, (1987), 111–153.

    Google Scholar 

  59. R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, Wiley, (1990).

    Google Scholar 

  60. J.E. Graver and J. Yackel, Some Graph Theoretic Results Associated with Ramsey’s Theorem, Journal of Combinatorial Theory, 4 (1968) 125–175.

    Article  MathSciNet  MATH  Google Scholar 

  61. R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  62. C. Grinstead and S. Roberts, On the Ramsey Numbers R(3,8) and R(3,9), Journal of Combinatorial Theory, Series B, 33 (1982) 27–51.

    Google Scholar 

  63. A. Gyárfás, M. Ruszinkó, G.N. Sárközy and E. Szemerédi, Three-color Ramsey Numbers for Paths, Combinatorica, 27 (2007) 35–69. Corrigendum in 28 (2008) 499–502.

    Google Scholar 

  64. A. Gyárfás, G.N. Sárközy and E. Szemerédi, The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs, Electronic Journal of Combinatorics, http://www.combinatorics.org, #R126, 15(1) (2008), 14 pages.

  65. M. Harborth and I. Mengersen, Some Ramsey Numbers for Complete Bipartite Graphs, Australasian Journal of Combinatorics, 13 (1996) 119–128.

    MathSciNet  MATH  Google Scholar 

  66. P.E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciski, M. Simonovits and J. Skokan, The Ramsey Number for Hypergraph Cycles I, Journal of Combinatorial Theory, Series A, 113 (2006) 67–83.

    Google Scholar 

  67. P.E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciski and J. Skokan, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, Combinatorics, Probability and Computing, 18 (2009) 165–203.

    Article  MATH  Google Scholar 

  68. G.R.T. Hendry, Ramsey Numbers for Graphs with Five Vertices, Journal of Graph Theory, 13 (1989) 245–248.

    Article  MathSciNet  MATH  Google Scholar 

  69. G.R.T. Hendry, Critical Colorings for Clancy’s Ramsey Numbers, Utilitas Mathematica, 41 (1992) 181–203.

    MathSciNet  MATH  Google Scholar 

  70. R.W. Irving, Generalised Ramsey Numbers for Small Graphs, Discrete Mathematics, 9 (1974) 251–264.

    Article  MathSciNet  MATH  Google Scholar 

  71. M.M.M. Jaradat and B.M.N. Alzaleq, The Cycle-Complete Graph Ramsey Number r(C 8,K 8), SUT Journal of Mathematics, 43 (2007) 85–98.

    MathSciNet  MATH  Google Scholar 

  72. M.M.M. Jaradat and A.M.M. Baniabedalruhman, The Cycle-Complete Graph Ramsey Number r(C 8,K 7), International Journal of Pure and Applied Mathematics, 41 (2007) 667–677.

    MathSciNet  MATH  Google Scholar 

  73. C.J. Jayawardene and C.C. Rousseau, An Upper Bound for the Ramsey Number of a Quadrilateral versus a Complete Graph on Seven Vertices, Congressus Numerantium, 130 (1998) 175–188.

    MathSciNet  MATH  Google Scholar 

  74. C.J. Jayawardene and C.C. Rousseau, Ramsey Numbers r(C 6,G) for All Graphs G of Order Less than Six, Congressus Numerantium, 136 (1999) 147–159.

    MathSciNet  MATH  Google Scholar 

  75. C.J. Jayawardene and C.C. Rousseau, The Ramsey Numbers for a Quadrilateral vs. All Graphs on Six Vertices, Journal of Combinatorial Mathematics and Combinatorial Computing, 35 (2000) 71–87. Erratum in 51 (2004) 221.

    Google Scholar 

  76. C.J. Jayawardene and C.C. Rousseau, Ramsey Numbers r(C 5, G) for All Graphs G of Order Six, Ars Combinatoria, 57 (2000) 163–173.

    MathSciNet  MATH  Google Scholar 

  77. C.J. Jayawardene and C.C. Rousseau, The Ramsey Number for a Cycle of Length Five vs. a Complete Graph of Order Six, Journal of Graph Theory, 35 (2000) 99–108.

    Google Scholar 

  78. J.G. Kalbfleisch, Chromatic Graphs and Ramsey’s Theorem, Ph.D. thesis, University of Waterloo, January 1966.

    Google Scholar 

  79. G. Károlyi and V. Rosta, Generalized and Geometric Ramsey Numbers for Cycles, Theoretical Computer Science, 263 (2001) 87–98.

    Article  MathSciNet  MATH  Google Scholar 

  80. G. Kéry, On a Theorem of Ramsey (in Hungarian), Matematikai Lapok, 15 (1964) 204–224.

    MathSciNet  MATH  Google Scholar 

  81. J.H. Kim, The Ramsey Number R(3, t) has Order of Magnitude t 2∕logt, Random Structures and Algorithms, 7 (1995) 173–207.

    Article  MathSciNet  MATH  Google Scholar 

  82. Y. Kohayakawa, M. Simonovits and J. Skokan, The 3-colored Ramsey Number of Odd Cycles, Electronic Notes in Discrete Mathematics, 19 (2005) 397–402. Extended version has been accepted by the Journal of Combinatorial Theory, SeriesB.

    Google Scholar 

  83. F. Lazebnik and D. Mubayi, New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs, Advances in Applied Mathematics, 28 (2002) 544–559.

    Article  MathSciNet  MATH  Google Scholar 

  84. F. Lazebnik and A. Woldar, New Lower Bounds on the Multicolor Ramsey Numbers r k (C 4), Journal of Combinatorial Theory, Series B, 79 (2000) 172–176.

    Google Scholar 

  85. Li Da Yong and Wang Zhi Jian, The Ramsey Number r(mC 4,nC 4) (in Chinese), Journal of Shanghai Tiedao University, 20 (1999) 66–70, 83.

    Google Scholar 

  86. Li Da Yong and Wang Zhi Jian, The Ramsey Numbers r(mC 4,nC 5), Journal of Combinatorial Mathematics and Combinatorial Computing, 45 (2003) 245–252.

    Google Scholar 

  87. Y. Li, Ramsey Numbers of a Cycle, Taiwanese Journal of Mathematics, 12 (2008) 1007–1013.

    MathSciNet  MATH  Google Scholar 

  88. Y. Li, The Multi-Color Ramsey Number of an Odd Cycle, Journal of Graph Theory, 62 (2009) 324–328.

    Article  MathSciNet  MATH  Google Scholar 

  89. Y. Li and K.-W. Lih, Multi-Color Ramsey Numbers of Even Cycles, European Journal of Combinatorics, 30 (2009) 114–118.

    Article  MathSciNet  MATH  Google Scholar 

  90. Y. Li and W. Zang, The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers, Journal of Combinatorial Optimization, 7 (2003) 353–359.

    Article  MathSciNet  MATH  Google Scholar 

  91. A.C.H. Ling, Some Applications of Combinatorial Designs to Extremal Graph Theory, Ars Combinatoria, 67 (2003) 221–229.

    MathSciNet  MATH  Google Scholar 

  92. T. Łuczak, R(C n ,C n ,C n )≤(4+o(1))n, Journal of Combinatorial Theory, Series B, 75 (1999) 174–187.

    Google Scholar 

  93. B.D. McKay and S.P. Radziszowski, The First Classical Ramsey Number for Hypergraphs is Computed, Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’91, San Francisco, (1991) 304–308.

    Google Scholar 

  94. B.D. McKay and K.M. Zhang, The Value of the Ramsey Number R(3,8), Journal of Graph Theory, 16 (1992) 99–105.

    Article  MathSciNet  MATH  Google Scholar 

  95. H. Mizuno and I. Sato, Ramsey Numbers for Unions of Some Cycles, Discrete Mathematics, 69 (1988) 283–294.

    Article  MathSciNet  MATH  Google Scholar 

  96. E.L. Monte Carmelo, Configurations in Projective Planes and Quadrilateral-Star Ramsey Numbers, Discrete Mathematics, 308 (2008) 3986–3991.

    Article  MathSciNet  MATH  Google Scholar 

  97. J. Nes̆etr̆il, Ramsey Theory, chapter 25 in Handbook of Combinatorics, (R.L. Graham, M. Grötschel and L. Lovász eds.), The MIT-Press, Vol. II, 1996, 1331–1403.

    Google Scholar 

  98. V. Nikiforov, The Cycle-Complete Graph Ramsey Numbers, Combinatorics, Probability and Computing, 14 (2005) 349–370.

    Article  MathSciNet  MATH  Google Scholar 

  99. V. Nikiforov and C.C. Rousseau, Ramsey Goodness and Beyond, Combinatorica, 29 (2009) 227–262.

    MathSciNet  MATH  Google Scholar 

  100. T.D. Parsons, Ramsey Graphs and Block Designs, I, Transactions of the American Mathematical Society, 209 (1975) 33–44.

    Article  MathSciNet  MATH  Google Scholar 

  101. T.D. Parsons, Ramsey Graphs and Block Designs, Journal of Combinatorial Theory, Series A, 20 (1976) 12–19.

    Google Scholar 

  102. T.D. Parsons, Graphs from Projective Planes, Aequationes Mathematica, 14 (1976) 167–189.

    Article  MathSciNet  MATH  Google Scholar 

  103. T.D. Parsons, Ramsey Graph Theory, in Selected Topics in Graph Theory, (L.W. Beineke and R.J. Wilson eds.), Academic, (1978) 361–384.

    Google Scholar 

  104. S.P. Radziszowski, Small Ramsey Numbers, Dynamic Survey in the Electronic Journal of Combinatorics, http://www.combinatorics.org/Surveys, #DS1, revision #12, (2009), 72 pages.

  105. S.P. Radziszowski and Jin Xia, Paths, Cycles and Wheels in Graphs without Antitriangles, Australasian Journal of Combinatorics, 9 (1994) 221–232.

    MathSciNet  MATH  Google Scholar 

  106. S.P. Radziszowski and D.L. Kreher, Upper Bounds for Some Ramsey Numbers R(3,k), Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 207–212.

    MathSciNet  MATH  Google Scholar 

  107. S.P. Radziszowski and K.-K. Tse, A Computational Approach for the Ramsey Numbers R(C 4,K n ), Journal of Combinatorial Mathematics and Combinatorial Computing, 42 (2002) 195–207.

    MathSciNet  MATH  Google Scholar 

  108. F.P. Ramsey, On a Problem of Formal Logic, Proceedings of the London Mathematical Society, 30 (1930) 264–286.

    Article  MathSciNet  Google Scholar 

  109. S. Rao, Applying a Genetic Algorithm to Improve the Lower Bounds of Multi-Color Ramsey Numbers, MS thesis, Department of Computer Science, Rochester Institute of Technology, (1997).

    Google Scholar 

  110. V. Rosta, On a Ramsey Type Problem of J.A. Bondy and P. Erdős, I & II, Journal of Combinatorial Theory, Series B, 15 (1973) 94–120.

    Google Scholar 

  111. C.C. Rousseau and C.J. Jayawardene, The Ramsey Number for a Quadrilateral vs. a Complete Graph on Six Vertices, Congressus Numerantium, 123 (1997) 97–108.

    Google Scholar 

  112. C.C. Rousseau and C.J. Jayawardene, Harary’s Problem for K2,k , unpublished manuscript, (1999).

    Google Scholar 

  113. C.C. Rousseau and J. Sheehan, On Ramsey Numbers for Books, Journal of Graph Theory, 2 (1978) 77–87.

    Article  MathSciNet  MATH  Google Scholar 

  114. I. Schiermeyer, All Cycle-Complete Graph Ramsey Numbers r(C m ,K 6), Journal of Graph Theory, 44 (2003) 251–260.

    Article  MathSciNet  MATH  Google Scholar 

  115. I. Schiermeyer, The Cycle-Complete Graph Ramsey Number r(C 5,K 7), Discussiones Mathematicae Graph Theory, 25 (2005) 129–139.

    Article  MathSciNet  MATH  Google Scholar 

  116. C.-U. Schulte, Ramsey-Zahlen für Bäume und Kreise, Ph.D. thesis, Heinrich-Heine-Universität Düsseldorf, (1992).

    Google Scholar 

  117. Z. Shao, X. Xu, X. Shi and L. Pan, Some Three-Color Ramsey Numbers R(P 4,P 5,C k ) and R(P 4,P 6,C k ), European Journal of Combinatorics, 30 (2009) 396–403.

    Article  MathSciNet  MATH  Google Scholar 

  118. W.C. Shiu, P.C.B. Lam and Y. Li, On Some Three-Color Ramsey Numbers, Graphs and Combinatorics, 19 (2003) 249–258.

    MathSciNet  MATH  Google Scholar 

  119. A. Soifer, The Mathematical Coloring Book, Mathematics of Coloring and the Colorful Life of Its Creators, Springer, (2009).

    Google Scholar 

  120. J.H. Spencer, Asymptotic Lower Bounds for Ramsey Functions, Discrete Mathematics, 20 (1977) 69–76.

    Article  MathSciNet  Google Scholar 

  121. J.H. Spencer, Eighty Years of Ramsey R(3,k)… and Counting! an essay in this volume.

    Google Scholar 

  122. B. Sudakov, A Note on Odd Cycle-Complete Graph Ramsey Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #N1, 9 (2002), 4 pages.

  123. Sun Yongqi, Research on Ramsey Numbers of Some Graphs (in Chinese), Ph. D. thesis, Dalian University of Technology, China, July 2006.

    Google Scholar 

  124. Sun Yongqi, Yang Yuansheng, Jiang Baoqi, Lin Xiaohui and Shi Lei, On Multicolor Ramsey Numbers for Even Cycles in Graphs, Ars Combinatoria, 84 (2007) 333–343.

    Google Scholar 

  125. Sun Yongqi, Yang Yuansheng, Lin Xiaohui and Zheng Wenping, The Value of the Ramsey Number R 4(C 4), Utilitas Mathematica, 73 (2007) 33–44.

    Google Scholar 

  126. Sun Yongqi, Yang Yuansheng, Lin Xiaohui and Zheng Wenping, On the Three Color Ramsey Numbers R(C m ,C 4,C 4), Ars Combinatoria, 84 (2007) 3–11.

    Google Scholar 

  127. Sun Yongqi, Yang Yuansheng and Wang Zhihai, The Value of the Ramsey Number R 5(C 6), Utilitas Mathematica, 76 (2008) 25–31.

    Google Scholar 

  128. Sun Yongqi, Yang Yuansheng, Wang Wei, Li Bingxi and Xu Feng, Study of Three Color Ramsey numbers R(C m1,C m2,C m3) (in Chinese), Journal of Dalian University of Technology, 46 (2006) 428–433.

    Google Scholar 

  129. Sun Yongqi, Yang Yuansheng, Xu Feng and Li Bingxi, New Lower Bounds on the Multicolor Ramsey Numbers R r (C 2m ), Graphs and Combinatorics, 22 (2006) 283–288.

    Google Scholar 

  130. Surahmat, Cycle-Wheel Ramsey Numbers. Some results, open problems and conjectures. Math Track, 2 (2006) 56–64.

    Google Scholar 

  131. Surahmat, E.T. Baskoro and H.J. Broersma, The Ramsey Numbers of Large Cycles versus Small Wheels, Integers: Electronic Journal of Combinatorial Number Theory, http://www.integersejcnt.org/vol4.html, #A10, 4 (2004), 9 pages.

  132. Surahmat, E.T. Baskoro and I. Tomescu, The Ramsey Numbers of Large Cycles versus Wheels, Discrete Mathematics, 306 (2006), 3334–3337.

    Google Scholar 

  133. Surahmat, E.T. Baskoro and I. Tomescu, The Ramsey Numbers of Large Cycles versus Odd Wheels, Graphs and Combinatorics, 24 (2008), 53–58.

    Google Scholar 

  134. Surahmat, E.T.Baskoro, S. Uttunggadewa and H.J. Broersma, An Upper Bound for the Ramsey Number of a Cycle of Length Four versus Wheels, in LNCS 3330, Springer, Berlin (2005) 181–184.

    Google Scholar 

  135. E. Szemerédi, Regular Partitions of Graphs, Problèmes Combinatoires et Théorie des Graphes (Orsay, 1976), Colloques Internationaux du Centre National de la Recherche Scientifique, CNRS Paris, 260 (1978) 399–401.

    Google Scholar 

  136. K.-K. Tse, On the Ramsey Number of the Quadrilateral versus the Book and the Wheel, Australasian Journal of Combinatorics, 27 (2003) 163–167.

    MathSciNet  MATH  Google Scholar 

  137. K.-K. Tse, A Note on the Ramsey Numbers R (C 4, B n ), Journal of Combinatorial Mathematics and Combinatorial Computing, 58 (2006) 97–100.

    MathSciNet  MATH  Google Scholar 

  138. K.-K. Tse, A Note on Some Ramsey Numbers R(C p , C q , C r ), Journal of Combinatorial Mathematics and Combinatorial Computing, 62 (2007) 189–192.

    MathSciNet  MATH  Google Scholar 

  139. X. Xu and S.P. Radziszowski, 28≤R(C 4,C 4,C 3,C 3)≤36, Utilitas Mathematica, 79 (2009) 253–257.

    MathSciNet  MATH  Google Scholar 

  140. X. Xu, Z. Shao and S.P. Radziszowski, Bounds on Some Ramsey Numbers Involving Quadrilateral, Ars Combinatoria, 90 (2009) 337–344.

    MathSciNet  MATH  Google Scholar 

  141. Y.J. Sheng, Y.R. Huang and K.M. Zhang, The Value of the Ramsey Number R(C n ,K 4) is 3(n - 1) + 1 (n≥4), Australasian Journal of Combinatorics, 20 (1999) 205–206.

    MathSciNet  MATH  Google Scholar 

  142. Y.J. Sheng, Y.R. Huang and K.M. Zhang, R(C 6,K 5)=21 and R(C 7,K 5)=25, European Journal of Combinatorics, 22 (2001) 561–567.

    Article  MathSciNet  MATH  Google Scholar 

  143. Yang Yuansheng and P. Rowlinson, On the Third Ramsey Numbers of Graphs with Five Edges, Journal of Combinatorial Mathematics and Combinatorial Computing, 11 (1992) 213–222.

    Google Scholar 

  144. Yang Yuansheng and P. Rowlinson, On Graphs without 6-Cycles and Related Ramsey Numbers, Utilitas Mathematica, 44 (1993) 192–196.

    Google Scholar 

  145. L.M. Zhang, Y.J. Chen and T.C. Edwin Cheng, The Ramsey Numbers for Cycles versus Wheels of Even Order, European Journal of Combinatorics, 31 (2010) 254–259.

    Article  MathSciNet  MATH  Google Scholar 

  146. Y. Zhang and K.M. Zhang, The Ramsey Number R(C 8,K 8), Discrete Mathematics, 309 (2009) 1084–1090.

    Article  MathSciNet  MATH  Google Scholar 

  147. H.L. Zhou, Some Ramsey Numbers for Graphs with Cycles (in Chinese), Mathematica Applicata, 6 (1993) 218.

    Google Scholar 

  148. H.L. Zhou, The Ramsey Number of an Odd Cycle with Respect to a Wheel (in Chinese), Journal of Mathematics, Shuxue Zazhi (Wuhan), 15 (1995) 119–120.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rochester Institute of Technology, Rochester, NY, 14623, USA

    Stanisław P. Radziszowski

Authors
  1. Stanisław P. Radziszowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stanisław P. Radziszowski .

Editor information

Editors and Affiliations

  1. at Colorado Springs, College of Letters, Arts, and Sciences, University of Colorado, Austin Bluffs Parkway 1420, Colorado Springs, 80918, Colorado, USA

    Alexander Soifer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Radziszowski, S.P. (2011). Ramsey Numbers Involving Cycles. In: Soifer, A. (eds) Ramsey Theory. Progress in Mathematics, vol 285. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8092-3_3

Download citation

Publish with us

Policies and ethics

Search

Navigation