Small ramsey numbers

Electronic Journal of Combinatorics

Volumn , Issue , 2009, Pages 1-72

  Radziszowski, StanisŁaw P ^a  

^a ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77955327189     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (727)

1. H.L. Abbott, Ph. D. thesis, University of Alberta, Edmonton, 1965.
2. H.L. Abbott, A Theorem Concerning Higher Ramsey Numbers, in Infinite and Finite Sets, (A. Hajnal, R. Rado and V.T. Sós eds.) Vol. 1, 25-28.
3. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North- Holland, Amsterdam, 1975.
4. H.L. Abbott and D. Hanson, A Problem of Schur and Its Generalizations, Acta Arithmetica, 20 (1972) 175-187.
5. H.L. Abbott and Andy Liu, Remarks on a Paper of Hirschfeld Concerning Ramsey Numbers, Discrete Mathematics, 39 (1982) 327-328.
6. H.L. Abbott and M.J. Smuga-Otto, Lower Bounds for Hypergraph Ramsey Numbers, Discrete Applied Mathematics, 61 (1995) 177-180.
7. H.L. Abbott and E.R. Williams, Lower Bounds for Some Ramsey Numbers, Journal of Combinatorial Theory, Series A, 16 (1974) 12-17.
8. M. Ajtai, J. Komlós and E. Szemerédi, A Note on Ramsey Numbers, Journal of Combinatorial Theory, Series A, 29 (1980) 354-360.
9. K. Ali and E.T. Baskoro, On the Ramsey Numbers for a Combination of Paths and Jahangirs, Journal of Combinatorial Mathematics and Combinatorial Computing, 65 (2008) 113-119.
10. s,m, Bull. Math. Soc. Sci. Math. R. S. Roumanie (N.S.), 51(99) (2008) 177-182.
11. K. Ali and Surahmat, A Cycle or Jahangir Ramsey Unsaturated Graphs, Journal of Prime Research in Mathematics, 2 (2006) 187-193.
12. N. Alon, Subdivided Graphs Have Linear Ramsey Numbers, Journal of Graph Theory, 18 (1994) 343-347.
13. N. Alon, Explicit Ramsey Graphs and Orthonormal Labelings, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R12, 1 (1994), 8 pages.
14. N. Alon, M. Krivelevich and B. Sudakov, Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions, Combinatorics, Probability and Computing, 12 (2003) 477-494.
15. N. Alon and P. Pudlák, Constructive Lower Bounds for off-diagonal Ramsey Numbers, Israel Journal of Mathematics, 122 (2001) 243-251.
16. N. Alon and V. Rödl, Sharp Bounds for Some Multicolor Ramsey Numbers, Combinatorica, 25 (2005) 125-141.
17. B.M.N. Alzaleq, see [JarAl].
18. J. Arste, K. Klamroth and I. Mengersen, Three Color Ramsey Numbers for Small Graphs, Utilitas Mathematica, 49 (1996) 85-96.
19. H. Assiyatun, see [HaBA1, HaBA2, BaHA].
20. M. Axenovich, Z. Füredi and D. Mubayi, On Generalized Ramsey Theory: the Bipartite Case, Journal of Combinatorial Theory, Series B, 79 (2000) 66-86.
21. 5), Bulletin of the Institute of Combinatorics and its Applications, 41 (2004) 71-76.
22. Bai Lufeng and Li Yusheng, Algebraic Constructions and Applications in Ramsey Theory, Advances in Mathematics, 35 (2006) 167-170.
23. Bai Lufeng, Li Yusheng and Xu Zhiqiang, Algebraic Constructions and Applications in Ramsey Theory, Journal of Mathematical Study, 37 (2004) 245-249.
24. Bai Lufeng, see also [SoBL].
25. P.N. Balister, J. Lehel and R.H. Schelp, Ramsey Unsaturated and Saturated Graphs, Journal of Graph Theory, 51 (2006) 22-32.
26. P.N. Balister, R.H. Schelp and M. Simonovits, A Note on Ramsey Size-Linear Graphs, Journal of Graph Theory, 39 (2002) 1-5.
27. A.M.M. Baniabedalruhman, see [JarBa].
28. Qiquan Bao, see [ShaXBP].
29. E.T. Baskoro, The Ramsey Number of Paths and Small Wheels, Majalah Ilmiah Himpunan Matematika Indonesia, MIHMI, 8 (2002) 13-16.
30. E.T. Baskoro, Hasmawati and H. Assiyatun, The Ramsey Numbers for Disjoint Unions of Trees, Discrete Mathematics, 306 (2006) 3297-3301.
31. E.T. Baskoro and Surahmat, The Ramsey Number of Paths with respect to Wheels, Discrete Mathematics, 294 (2005) 275-277.
32. E.T. Baskoro, Surahmat, S.M. Nababan and M. Miller, On Ramsey Graph Numbers for Trees versus Wheels of Five or Six Vertices, Graphs and Combinatorics, 18 (2002) 717-721.
33. E.T. Baskoro, see also [AliBas, AliBT, HaBA1, HaBA2, SuBa1, SuBa2, SuBB1, SuBB2, SuBB3, SuBB4, SuBT1, SuBT2, SuBTB, SuBUB].
34. D. Bevan, personal communication (2002).
35. A. Beveridge and O. Pikhurko, On the Connectivity of Extremal Ramsey Graphs, Australasian Journal of Combinatorics, 41 (2008) 57-61.
36. 4, in Graph Theory and Combinatorics (ed. B. Bollobás), Academic Press, London, (1984) 29-33.
37. H. Bielak, Ramsey and 2-local Ramsey Numbers for Disjoint Unions of Cycles, Discrete Mathematics, 307 (2007) 319-330.
38. H. Bielak, Ramsey Numbers for a Disjoint Union of Some Graphs, Applied Mathematics Letters, 22 (2009) 475-477.
39. J. Bierbrauer, Ramsey Numbers for the Path with Three Edges, European Journal of Combinatorics, 7 (1986) 205-206.
40. J. Bierbrauer and A. Brandis, On Generalized Ramsey Numbers for Trees, Combinatorica, 5 (1985) 95-107.
41. K. Black, D. Leven and S.P. Radziszowski, New Bounds on Some Ramsey Numbers, in preparation, (2009).
42. B. Bollobás, C.J. Jayawardene, Yang Jian Sheng, Huang Yi Ru, C.C. Rousseau, and Zhang Ke Min, On a Conjecture Involving Cycle-Complete Graph Ramsey Numbers, Australasian Journal of Combinatorics, 22 (2000) 63-71.
43. 5), in The Theory and Applications of Graphs, (Kalamazoo, MI, 1980), John Wiley & Sons, New York, (1981) 109-116.
44. J.A. Bondy and P. Erdös, Ramsey Numbers for Cycles in Graphs, Journal of Combinatorial Theory, Series B, 14 (1973) 46-54.
45. A. Brandis, see [BB].
46. S. Brandt, Subtrees and Subforests in Graphs, Journal of Combinatorial Theory, Series B, 61 (1994) 63-70.
47. S. Brandt, Sufficient Conditions for Graphs to Contain All Subgraphs of a Given Type, Ph.D. thesis, Freie Universität Berlin, 1994.
48. S. Brandt, Expanding Graphs and Ramsey Numbers, manuscript, (1996).
49. 3,G) for Connected Graphs of Order 9, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R7, 5 (1998), 20 pages.
50. S. Brandt, G. Brinkmann and T. Harmuth, The Generation of Maximal Triangle-Free Graphs, Graphs and Combinatorics, 16 (2000) 149-157.
51. 3,G) for Connected Graphs of Order 7 and 8, Combinatorics, Probability and Computing, 7 (1998) 129-140.
52. G. Brinkmann, see also [BBH1, BBH2].
53. H.J. Broersma, see [SaBr1, SaBr2, SaBr3, SaBr4, SuBB1, SuBB2, SuBB3, SuBB4, SuBTB, SuBUB].
54. J.P. Burling and S.W. Reyner, Some Lower Bounds of the Ramsey Numbers n (k, k), Journal of Combinatorial Theory, Series B, 13 (1972) 168-169.
55. 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.
56. S.A. Burr, Ramsey Numbers Involving Graphs with Long Suspended Paths, Journal of the London Mathematical Society (2), 24 (1981) 405-413.
57. S.A. Burr, Multicolor Ramsey Numbers Involving Graphs with Long Suspended Path, Discrete Mathematics, 40 (1982) 11-20.
58. S.A. Burr, Diagonal Ramsey Numbers for Small Graphs, Journal of Graph Theory, 7 (1983) 57-69.
59. S.A. Burr, Ramsey Numbers Involving Powers of Sparse Graphs, Ars Combinatoria, 15 (1983) 163-168.
60. S.A. Burr, Determining Generalized Ramsey Numbers is NP-Hard, Ars Combinatoria, 17 (1984) 21-25.
61. S.A. Burr, What Can We Hope to Accomplish in Generalized Ramsey Theory?, Discrete Mathematics, 67 (1987) 215-225.
62. S.A. Burr, On the Ramsey Numbers r (G, nH) and r (nG, nH) When n Is Large, Discrete Mathematics, 65 (1987) 215-229.
63. S.A. Burr, On Ramsey Numbers for Large Disjoint Unions of Graphs, Discrete Mathematics, 70 (1988) 277-293.
64. S.A. Burr, On the Computational Complexity of Ramsey-type Problems, Mathematics of Ramsey Theory, Algorithms and Combinatorics, 5, Springer, Berlin, 1990, 46-52.
65. S.A. Burr and P. Erdös, On the Magnitude of Generalized Ramsey Numbers for Graphs, in Infinite and Finite Sets, (A. Hajnal, R. Rado and V.T. Sós eds., Keszthely 1973) Vol. 1, 215-240.
66. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975.
67. S.A. Burr and P. Erdös, Extremal Ramsey Theory for Graphs, Utilitas Mathematica, 9 (1976) 247-258.
68. S.A. Burr and P. Erdös, Generalizations of a Ramsey-Theoretic Result of Chvátal, Journal of Graph Theory, 7 (1983) 39-51.
69. S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, An Extremal Problem in Generalized Ramsey Theory, Ars Combinatoria, 10 (1980) 193-203.
70. 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.
71. S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, On Ramsey Numbers Involving Starlike Multipartite Graphs, Journal of Graph Theory, 7 (1983) 395-409.
72. S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, The Ramsey Number for the Pair Complete Bipartite Graph-Graph of Limited Degree, in Graph Theory with Applications to Algorithms and Computer Science, (Y. Alavi eds.), John Wiley & Sons, New York, (1985) 163-174.
73. 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.
74. S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau, R.H. Schelp, R.J. Gould and M.S. Jacobson, Goodness of Trees for Generalized Books, Graphs and Combinatorics, 3 (1987) 1-6.
75. S.A. Burr, P. Erdös, R.J. Faudree and R.H. Schelp, On the Difference between Consecutive Ramsey Numbers, Utilitas Mathematica, 35 (1989) 115-118.
76. 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.
77. S.A. Burr and R.J. Faudree, On Graphs G for Which All Large Trees Are G-good, Graphs and Combinatorics, 9 (1993) 305-313.
78. S.A. Burr and J.W. Grossman, Ramsey Numbers of Graphs with Long Tails, Discrete Mathematics, 41 (1982) 223-227.
79. S.A. Burr and J.A. Roberts, On Ramsey Numbers for Stars, Utilitas Mathematica, 4 (1973) 217-220.
80. S.A. Burr and J.A. Roberts, On Ramsey Numbers for Linear Forests, Discrete Mathematics, 8 (1974) 245-250.
81. S.A. Burr and V. Rosta, On the Ramsey Multiplicities of Graphs - Problems and Recent Results, Journal of Graph Theory, 4 (1980) 347-361.
82. L.E. Bush, The William Lowell Putnam Mathematical Competition (question #2 in Part I asks for the proof of R (3,3) ≤ 6), American Mathematical Monthly, 60 (1953) 539-542.
83. N.J. Calkin, P. Erdös and C.A. Tovey, New Ramsey Bounds from Cyclic Graphs of Prime Order, SIAM Journal of Discrete Mathematics, 10 (1997) 381-387.
84. D. Cariolaro, On the Ramsey Number R (3, 6), Australasian J. of Combinatorics, 37 (2007) 301-304.
85. Y. Caro, Zero-Sum Problems - A Survey, Discrete Mathematics, 152 (1996) 93-113.
86. Y. Caro, Li Yusheng, C.C. Rousseau and Zhang Yuming, Asymptotic Bounds for Some Bipartite Graph - Complete Graph Ramsey Numbers, Discrete Mathematics, 220 (2000) 51-56.
87. G. Chartrand, R.J. Gould and A.D. Polimeni, On Ramsey Numbers of Forests versus Nearly Complete Graphs, Journal of Graph Theory, 4 (1980) 233-239.
88. 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, (Kalamazoo, MI 1980), John Wiley & Sons, (1981) 203-214.
89. G. Chartrand and S. Schuster, On the existence of specified cycles in complementary graphs, Bulletin of the American Mathematical Society, 77 (1971) 995-998.
90. 4-Star Ramsey Numbers, Discrete Mathematics, 163 (1997) 243-246.
91. Chen Guantao and R.H. Schelp, Graphs with Linearly Bounded Ramsey Numbers, Journal of Combinatorial Theory, Series B, 57 (1993) 138-149.
92. Chen Hong, see [WuCXS].
93. Chen Jie, The Lower Bound of Some Ramsey Numbers (in Chinese), Journal of Liaoning Normal University, Natural Science, 25 (2002) 244-246.
94. Yaojun Chen, T.C. Edwin Cheng, Zhengke Miao and C.T. Ng, The Ramsey Numbers for Cycles versus Wheels of Odd Order, to appear, (2009).
95. Yaojun Chen, T.C. Edwin Cheng and C.T. Ng, A Theorem on Cycle-Wheel Ramsey Number, manuscript, (2009).
96. Yaojun 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.
97. 8), European Journal of Combinatorics, 29 (2008) 1337-1352.
98. Yaojun Chen, T.C. Edwin Cheng and Yunqing Zhang, The Ramsey Numbers for Stars of Odd Order versus a Wheel of Order Nine, to appear, (2009).
99. Chen Yaojun, Zhang Yunqing and Zhang Ke Min, The Ramsey Numbers of Paths versus Wheels, Discrete Mathematics, 290 (2005) 85-87.
100. Chen Yaojun, Zhang Yunqing and Zhang Ke Min, The Ramsey Numbers of Stars versus Wheels, European Journal of Combinatorics, 25 (2004) 1067-1075.
101. n) ≥ n-3, Applied Mathematics Letters, 17 (2004) 281-285.
102. 7, European Journal of Combinatorics, 27 (2006) 558-564.
103. 6) for Small n, Utilitas Mathematica, 67 (2005) 269-284.
104. n without Certain Deletable Sets, Journal of Systems Science and Complexity, 18 (2005) 95-101.
105. Chen Yaojun, see also [CheCZN, ZhaCC, ZhaCZ1, ZhaCZ2].
106. Cheng Ying, On Graphs Which Do Not Contain Certain Trees, Ars Combinatoria, 19 (1985) 119-151.
107. T.C. Edwin Cheng, Yaojun Chen, Yunqing 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.
108. T.C. Edwin Cheng, see also [ChenCMN, ChenCN, ChenCX, ChenCZ1, ChenCZ2, ZhaCC].
109. F.R.K. Chung, On the Ramsey Numbers N(3,3,.,3; 2), Discrete Mathematics, 5 (1973) 317-321.
110. 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.
111. F.R.K. Chung, A Note on Constructive Methods for Ramsey Numbers, Journal of Graph Theory, 5 (1981) 109-113.
112. F.R.K. Chung, Open problems of Paul Erdös in Graph Theory, Journal of Graph Theory, 25 (1997) 3-36.
113. F.R.K. Chung, R. Cleve and P. Dagum, A Note on Constructive Lower Bounds for the Ramsey Numbers R (3, t), Journal of Combinatorial Theory, Series B, 57 (1993) 150-155.
114. 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.
115. F.R.K. Chung and R.L. Graham, Erdös on Graphs, His Legacy of Unsolved Problems, A K Peters, Wellesley, Massachusetts (1998).
116. F.R.K. Chung and C.M. Grinstead, A Survey of Bounds for Classical Ramsey Numbers, Journal of Graph Theory, 7 (1983) 25-37.
117. V. Chvátal, Tree-Complete Graph Ramsey Numbers, Journal of Graph Theory, 1 (1977) 93.
118. 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.
119. V. Chvátal and F. Harary, Generalized Ramsey Theory for Graphs, III. Small Off-Diagonal Numbers, Pacific Journal of Mathematics, 41 (1972) 335-345.
120. V. Chvátal and F. Harary, Generalized Ramsey Theory for Graphs, I. Diagonal Numbers, Periodica Mathematica Hungarica, 3 (1973) 115-124.
121. V. Chvátal, V. Rödl, E. Szemerédi and W.T. Trotter Jr., The Ramsey Number of a Graph with Bounded Maximum Degree, Journal of Combinatorial Theory, Series B, 34 (1983) 239-243.
122. 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.
123. M. Clancy, Some Small Ramsey Numbers, Journal of Graph Theory, 1 (1977) 89-91.
124. 4), Periodica Mathematica Hungarica, 18 (1987) 317-318.
125. 5-e, Journal of Graph Theory, 13 (1989) 7-15.
126. L. Clark, On Cycle-Star Graph Ramsey Numbers, Congressus Numerantium, 50 (1985) 187-192.
127. R. Cleve, see [CCD].
128. E.J. Cockayne, Some Tree-Star Ramsey Numbers, Journal of Combinatorial Theory, Series B, 17 (1974) 183-187.
129. E.J. Cockayne and P.J. Lorimer, The Ramsey Number for Stripes, Journal of the Australian Mathematical Society, Series A, 19 (1975) 252-256.
130. E.J. Cockayne and P.J. Lorimer, On Ramsey Graph Numbers for Stars and Stripes, Canadian Mathematical Bulletin, 18 (1975) 31-34.
131. B. Codenotti, P. Pudlák and G. Resta, Some Structural Properties of Low-Rank Matrices Related to Computational Complexity, Theoretical Computer Science, 235 (2000) 89-107.
132. Special issue on Ramsey theory of Combinatorics, Probability and Computing, 12 (2003), Numbers 5 and 6.
133. D. Conlon, A New Upper Bound for Diagonal Ramsey Numbers, to appear in the Annals of Mathematics.
134. D. Conlon, Hypergraph Packing and Sparse Bipartite Ramsey Numbers, to appear in Combinatorics, Probability and Computing.
135. D. Conlon, J. Fox and B. Sudakov, Hypergraph Ramsey Numbers, manuscript, (2009).
136. D. Conlon, J. Fox and B. Sudakov, Large Almost Monochromatic Subsets in Hypergraphs, manuscript, (2009).
137. D. Conlon, J. Fox and B. Sudakov, Ramsey Numbers of Sparse Hypergraphs, Random Structures and Algorithms, 35 (2009) 1-14.
138. O. Cooley, N. Fountoulakis, D. Kühn and D. Osthus, 3-Uniform Hypergraphs of Bounded Degree Have Linear Ramsey Numbers, Journal of Combinatorial Theory, Series B, 98 (2008) 484-505.
139. O. Cooley, see also [KüCFO].
140. R. Csákány and J. Komlós, The Smallest Ramsey Numbers, Discrete Mathematics, 199 (1999) 193-199.
141. P. Dagum, see [CCD].
142. T. Denley, The Ramsey Numbers for Disjoint Unions of Cycles, Discrete Mathematics, 149 (1996) 31-44.
143. Lin Dong, Yusheng Li and Qizhong Lin, Ramsey Numbers Involving Graphs with Large Degrees, to appear in Applied Mathematics Letters, (2009).
144. Duan Chanlun and Huang Wenke, Lower Bound of Ramsey Number r (3, 10) (in Chinese), Acta Scientiarum Naturalium Universitatis Nei Mongol, 31 (2000) 468-470.
145. k (l r), Discrete Mathematics, 137 (1995) 177-187.
146. T. Dzido, Multicolor Ramsey Numbers for Paths and Cycles, Discussiones Mathematicae Graph Theory, 25 (2005) 57-65.
147. T. Dzido and R. Fidytek, The Number of Critical Colorings for Some Ramsey Numbers, International Journal of Pure and Applied Mathematics, ISSN 1311-8080, 38 (2007) 433-444.
148. T. Dzido and R. Fidytek, On Some Three Color Ramsey Numbers for Paths and Cycles, Discrete Mathematics, 309 (2009) 4955-4958.
149. 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.
150. 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.
151. Easy to obtain by simple combinatorics from other results, in particular by using graphs establishing lower bounds with smaller parameters.
152. Unique 2-(6,3,2) design gives lower bound 7, upper bound is easy.
153. N. Eaton, Ramsey Numbers for Sparse Graphs, Discrete Mathematics, 185 (1998) 63-75.
154. P. Erdös, Some Remarks on the Theory of Graphs, Bulletin of the American Mathematical Society, 53 (1947) 292-294.
155. P. Erdös, On the Combinatorial Problems Which I Would Most Like to See Solved, Combinatorica, 1 (1981) 25-42.
156. 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.
157. 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.
158. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Ramsey Numbers for Brooms, Congressus Numerantium, 35 (1982) 283-293.
159. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Multipartite Graph-Sparse Graph Ramsey Numbers, Combinatorica, 5 (1985) 311-318.
160. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, A Ramsey Problem of Harary on Graphs with Prescribed Size, Discrete Mathematics, 67 (1987) 227-233.
161. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Extremal Theory and Bipartite Graph-Tree Ramsey Numbers, Discrete Mathematics, 72 (1988) 103-112.
162. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, The Book-Tree Ramsey Numbers, Scientia, Series A: Mathematical Sciences, Valparaíso, Chile, 1 (1988) 111-117.
163. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Multipartite Graph-Tree Graph Ramsey Numbers, in Graph Theory and Its Applications: East and West, Proceedings of the First China-USA International Graph Theory Conference, Annals of the New York Academy of Sciences, 576 (1989) 146-154.
164. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, Ramsey Size Linear Graphs, Combinatorics, Probability and Computing, 2 (1993) 389-399.
165. 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
166. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North Holland, 1975.
167. P. Erdös, see also [BoEr, BE1, BE2, BE3, BEFRS1, BEFRS2, BEFRS3, BEFRS4, BEFRS5, BEFRSGJ, BEFS, BES, CET].
168. G. Exoo, Ramsey Numbers of Hypergraphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 2 (1987) 5-11.
169. G. Exoo, Constructing Ramsey Graphs with a Computer, Congressus Numerantium, 59 (1987) 31-36.
170. G. Exoo, Applying Optimization Algorithm to Ramsey Problems, in Graph Theory, Combinatorics, Algorithms, and Applications (Y. Alavi ed.), SIAM Philadelphia, (1989) 175-179.
171. G. Exoo, A Lower Bound for R (5, 5), Journal of Graph Theory, 13 (1989) 97-98.
172. G. Exoo, On Two Classical Ramsey Numbers of the Form R (3, n), SIAM Journal of Discrete Mathematics, 2 (1989) 488-490.
173. 5), Utilitas Mathematica, 38 (1990) 187-188.
174. 4-e, Discrete Mathematics, 89 (1991) 301-305.
175. G. Exoo, Indiana State University, personal communication (1992).
176. G. Exoo, Announcement: On the Ramsey Numbers R (4, 6), R (5, 6) and R (3,12), Ars Combinatoria, 35 (1993) 85. The construction of a graph proving R (4, 6) ≥ 35 is presented in detail at http://ginger.indstate.edu/ge/RAMSEY (2001).
177. 3, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R8, 1 (1994), 3 pages.
178. G. Exoo, Indiana State University, personal communication (1997).
179. G. Exoo, Some New Ramsey Colorings, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R29, 5 (1998), 5 pages. The constructions are available electronically from http://ginger.indstate.edu/ge/RAMSEY.
180. G. Exoo, Indiana State University, personal communication (1998). Constructions available at http://ginger.indstate.edu/ge/RAMSEY.
181. G. Exoo, Indiana State University, New Lower Bounds for Table III, (2000). Constructions available at http://ginger.indstate.edu/ge/RAMSEY.
182. G. Exoo, Some Applications of pq -groups in Graph Theory, Discussiones Mathematicae Graph Theory, 24 (2004) 109-114. Constructions available at http://ginger.indstate.edu/ge/RAMSEY.
183. G. Exoo, Indiana State University, personal communication (2002-2004). Constructions available at http://ginger.indstate.edu/ge/RAMSEY.
184. G. Exoo, Indiana State University, personal communication (2005-2006). Constructions available at http://ginger.indstate.edu/ge/RAMSEY.
185. 5-e, Ars Combinatoria, 25A (1988) 277-286.
186. 2,n, in Graph Theory, Combinatorics, Algorithms, and Applications (Y. Alavi, F.R.K. Chung, R.L. Graham and D.F. Hsu eds.), SIAM Philadelphia, (1989) 207-211.
187. 5-Decompositions, Discrete Mathematics, 71 (1988) 119-127.
188. G. Exoo, see also [CEHMS, XXER].
189. R.J. Faudree, S.L. Lawrence, T.D. Parsons and R.H. Schelp, Path-Cycle Ramsey Numbers, Discrete Mathematics, 10 (1974) 269-277.
190. 6), Journal of Combinatorial Mathematics and Combinatorial Computing, 13 (1993) 23-31.
191. R.J. Faudree, C.C. Rousseau and R.H. Schelp, All Triangle-Graph Ramsey Numbers for Connected Graphs of Order Six, Journal of Graph Theory, 4 (1980) 293-300.
192. 5-e), in Graph Theory and Its Applications to Algorithms and Computer Science, (Y. Alavi eds.), John Wiley and Sons, New York, (1985) 251-271.
193. R.J. Faudree, C.C. Rousseau and R.H. Schelp, Generalizations of the Tree-Complete Graph Ramsey Number, in Graphs and Applications, (F. Harary and J.S. Maybee eds.), John Wiley and Sons, New York, (1985) 117-126.
194. R.J. Faudree, C.C. Rousseau and R.H. Schelp, Small Order Graph-Tree Ramsey Numbers, Discrete Mathematics, 72 (1988) 119-127.
195. R.J. Faudree, C.C. Rousseau and R.H. Schelp, A Good Idea in Ramsey Theory, in Graph Theory, Combinatorics, Algorithms, and Applications (San Francisco, CA 1989), SIAM Philadelphia, PA (1991) 180-189.
196. 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.
197. R.J. Faudree, C.C. Rousseau and J. Sheehan, Strongly Regular Graphs and Finite Ramsey Theory, Linear Algebra and its Applications, 46 (1982) 221-241.
198. R.J. Faudree, C.C. Rousseau and J. Sheehan, Cycle-Book Ramsey Numbers, Ars Combinatoria, 31 (1991) 239-248.
199. R.J. Faudree and R.H. Schelp, All Ramsey Numbers for Cycles in Graphs, Discrete Mathematics, 8 (1974) 313-329.
200. R.J. Faudree and R.H. Schelp, Path Ramsey Numbers in Multicolorings, Journal of Combinatorial Theory, Series B, 19 (1975) 150-160.
201. R.J. Faudree and R.H. Schelp, Ramsey Numbers for All Linear Forests, Discrete Mathematics, 16 (1976) 149-155.
202. 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.
203. R.J. Faudree, R.H. Schelp and C.C. Rousseau, Generalizations of a Ramsey Result of Chvátal, in Proceedings of the Fourth International Conference on the Theory and Applications of Graphs, (Kalamazoo, MI 1980), John Wiley & Sons, (1981) 351-361.
204. 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.
205. 7), Discussionesa Mathematicae Graph Theory, 23 (2003) 141-158.
206. R.J. Faudree and M. Simonovits, Ramsey Problems and Their Connection to Turán-Type Extremal Problems, Journal of Graph Theory, 16 (1992) 25-50.
207. R.J. Faudree, see also [BEFRS1, BEFRS2, BEFRS3, BEFRS4, BEFRS5, BEFRSGJ, BEFS, BF, EFRS1, EFRS2, EFRS3, EFRS4, EFRS5, EFRS6, EFRS7, EFRS8, EFRS9].
208. S. Fettes, R.L. Kramer and S.P. Radziszowski, An Upper Bound of 62 on the Classical Ramsey Number R (3,3,3,3), Ars Combinatoria, 72 (2004) 41-63.
209. R. Fidytek, see [DzFi1, DzFi2].
210. 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.
211. J. Folkman, Notes on the Ramsey Number N(3,3,3,3), Journal of Combinatorial Theory, Series A, 16 (1974) 371-379.
212. N. Fountoulakis, see [CooFKO, KüCFO].
213. J. Fox and B. Sudakov, Daensity Theorems for Bipartite Graphs and Related Ramsey-type Results, to appear, (2009).
214. J. Fox and B. Sudakov, Two Remarks on the Burr-Erdös Conjecture, to appear, (2009).
215. J. Fox, see also [ConFS1, ConFS2, ConFS3].
216. P. Frankl and R.M. Wilson, Intersection Theorems with Geometric Consequences, Combinatorica, 1 (1981) 357-368.
217. K. Fraughnaugh Jones, Independence in Graphs with Maximum Degree Four, Journal of Combinatorial Theory, Series B, 37 (1984) 254-269.
218. K. Fraughnaugh Jones, Size and Independence in Triangle-Free Graphs with Maximum Degree Three, Journal of Graph Theory, 14 (1990) 525-535.
219. K. Fraughnaugh and S.C. Locke, Finding Independent Sets in Triangle-free Graphs, SIAM Journal of Discrete Mathematics, 9 (1996) 674-681.
220. H. Fredricksen, Schur Numbers and the Ramsey Numbers N(3,3,.,3; 2), Journal of Combinatorial Theory, Series A, 27 (1979) 376-377.
221. H. Fredricksen and M.M. Sweet, Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R32, 7 (2000), 9 pages.
222. Z. Füredi, see [AFM].
223. W. Gasarch, Applications of Ramsey Theory to Computer Science, collection of pointers to papers, http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html (2009).
224. S. Gautam, A.K. Srivastava and A. Tripathi, On Multicolour Noncomplete Ramsey Graphs of Star Graphs, Discrete Applied Mathematics, 156 (2008) 2423-2428.
225. 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.
226. G. Giraud, Une généralisation des nombres et de l'inégalité de Schur, C.R. Acad. Sc. Paris, Séries AB, 266 (1968) A437-A440.
227. G. Giraud, Minoration de certains nombres de Ramsey binaires par les nombres de Schur généralisés, C.R. Acad. Sc. Paris, Séries A-B, 266 (1968) A481-A483.
228. G. Giraud, Nouvelles majorations des nombres de Ramsey binaires-bicolores, C.R. Acad. Sc. Paris, Séries A-B, 268 (1969) A5-A7.
229. G. Giraud, Majoration du nombre de Ramsey ternaire-bicolore en (4,4), C.R. Acad. Sc. Paris, Séries A-B, 269 (1969) A620-A622.
230. G. Giraud, Une minoration du nombre de quadrangles unicolores et son application à la majoration des nombres de Ramsey binaires-bicolores, C.R. Acad. Sc. Paris, Séries A-B, 276 (1973) A1173-A1175.
231. G. Giraud, Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, Journal of Combinatorial Theory, Series B, 27 (1979) 237-253.
232. A.M. Gleason, see [GG].
233. 3,G), Discrete Mathematics, 125 (1994) 177-182.
234. A. Gonçalves and E.L. Monte Carmelo, Some Geometric Structures and Bounds for Ramsey Numbers, Discrete Mathematics, 280 (2004) 29-38.
235. R.J. Gould and M.S. Jacobson, Bounds for the Ramsey Number of a Disconnected Graph Versus Any Graph, Journal of Graph Theory, 6 (1982) 413-417.
236. R.J. Gould and M.S. Jacobson, On the Ramsey Number of Trees Versus Graphs with Large Clique Number, Journal of Graph Theory, 7 (1983) 71-78.
237. R.J. Gould, see also [BEFRSGJ, CGP].
238. R.L. Graham and J. Nešetřil, Ramsey Theory and Paul Erdös (Recent Results from a Historical Perspective), Bolyai Society Mathematical Studies, 11, Budapest (2002) 339-365.
239. R.L. Graham and V. Rödl, Numbers in Ramsey Theory, in Surveys in Combinatorics, (ed. C. Whitehead), Cambridge University Press, 1987, 111-153.
240. R.L. Graham, V. Rödl and A. Ruciński, On Graphs with Linear Ramsey Numbers, Journal of Graph Theory, 35 (2000) 176-192.
241. R.L. Graham, V. Rödl and A. Ruciński, On Bipartite Graphs with Linear Ramsey Numbers, Paul Erdös and his mathematics, Combinatorica, 21 (2001) 199-209.
242. R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, John Wiley & Sons, 1990.
243. R.L. Graham, see also [ChGra1, ChGra2, EG].
244. J.E. Graver and J. Yackel, Some Graph Theoretic Results Associated with Ramsey's Theorem, Journal of Combinatorial Theory, 4 (1968) 125-175.
245. R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.
246. U. Grenda and H. Harborth, The Ramsey Number r (K3,K7 - e), Journal of Combinatorics, Information & System Sciences, 7 (1982) 166-169.
247. J.R. Griggs, An Upper Bound on the Ramsey Numbers R (3,k), Journal of Combinatorial Theory, Series A, 35 (1983) 145-153.
248. 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.
249. C. Grinstead, see also [ChGri].
250. V. Grolmusz, Superpolynomial Size Set-Systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs, Combinatorica, 20 (2000) 73-88.
251. V. Grolmusz, Low Rank Co-Diagonal Matrices and Ramsey Graphs, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R15, 7 (2000) 7 pages.
252. V. Grolmusz, Set-Systems with Restricted Multiple Intersections, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R8, 9 (2002) 10 pages.
253. J.W. Grossman, Some Ramsey Numbers of Unicyclic Graphs, Ars Combinatoria, 8 (1979) 59-63.
254. J.W. Grossman, The Ramsey Numbers of the Union of Two Stars, Utilitas Mathematica, 16 (1979) 271-279.
255. J.W. Grossman, F. Harary and M. Klawe, Generalized Ramsey Theory for Graphs, X: Double Stars, Discrete Mathematics, 28 (1979) 247-254.
256. J.W. Grossman, see also [BG].
257. 1,n, Journal of Nanjing University Mathematical Biquarterly, 19 (2002) 150-153.
258. 1,4,G) for All Three-Partite Graphs G of Order Six, Journal of Southeast University, (English Edition), 20 (2004) 378-380.
259. Gu Hua, see also [SoGQ].
260. Guo Yubao and L. Volkmann, Tree-Ramsey Numbers, Australasian Journal of Combinatorics, 11 (1995) 169-175.
261. L. Gupta, see [GGS].
262. S.K. Gupta, L. Gupta and A. Sudan, On Ramsey Numbers for Fan-Fan Graphs, Journal of Combinatorics, Information & System Sciences, 22 (1997) 85-93.
263. 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.
264. Corrigendum in 28 (2008) 499-502.
265. 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.
266. A. Gyárfás and Z. Tuza, An Upper Bound on the Ramsey Number of Trees, Discrete Mathematics, 66 (1987) 309-310.
267. A. Gyárfás, see also [GeGy].
268. R. Häggkvist, On the Path-Complete Bipartite Ramsey Number, Discrete Mathematics, 75 (1989) 243-245.
269. D. Hanson, Sum-free Sets and Ramsey Numbers, Discrete Mathematics, 14 (1976) 57-61.
270. D. Hanson, see also [AbbH].
271. F. Harary, Recent Results on Generalized Ramsey Theory for Graphs, in Graph Theory and Applications, (Y. Alavi eds.) Springer, Berlin (1972) 125-138.
272. F. Harary, Generalized Ramsey Theory I to XIII: Achievement and Avoidance Numbers, in Proceedings of the Fourth International Conference on the Theory and Applications of Graphs, (Kalamazoo, MI 1980), John Wiley & Sons, (1981) 373-390.
273. F. Harary, see also [CH1, CH2, CH3, GHK].
274. H. Harborth and S. Krause, Ramsey Numbers for Circulant Colorings, Congressus Numerantium, 161 (2003) 139-150.
275. 5 - e), Journal of Graph Theory, 9 (1985) 483-485.
276. H. Harborth and I. Mengersen, All Ramsey Numbers for Five Vertices and Seven or Eight Edges, Discrete Mathematics, 73 (1988/89) 91-98.
277. 3,3, in Combinatorics, Graph Theory, and Applications, Vol. 2 (Y. Alavi, G. Chartrand, O.R. Oellermann and J. Schwenk eds.), John Wiley & Sons, (1991) 639-644.
278. H. Harborth, see also [BH, CEHMS, EHM1, EHM2, GH].
279. M. Harborth and I. Mengersen, Some Ramsey Numbers for Complete Bipartite Graphs, Australasian Journal of Combinatorics, 13 (1996) 119-128.
280. T. Harmuth, see [BBH1, BBH2].
281. Hasmawati, E.T. Baskoro and H. Assiyatun, Star-Wheel Ramsey Numbers, Journal of Combinatorial Mathematics and Combinatorial Computing, 55 (2005) 123-128.
282. Hasmawati, E.T. Baskoro and H. Assiyatun, The Ramsey Numbers for Disjoint Unions of Graphs, Discrete Mathematics, 308 (2008) 2046-2049.
283. Hasmawati, see also [BaHA].
284. P.E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciński, M. Simonovits and J. Skokan, The Ramsey Number for Hypergraph Cycles I, Journal of Combinatorial Theory, Series A, 113 (2006) 67-83.
285. P.E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciński and J. Skokan, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, Combinatorics, Probability and Computing, 18 (2009) 165-203.
286. P.E. Haxell, T. Łuczak and P.W. Tingley, Ramsey Numbers for Trees of Small Maximum Degree, Combinatorica, 22 (2002) 287-320.
287. K. Heinrich, Proper Colourings of K15, Journal of the Australian Mathematical Society, Series A, 24 (1977) 465-495.
288. G.R.T. Hendry, Diagonal Ramsey Numbers for Graphs with Seven Edges, Utilitas Mathematica, 32 (1987) 11-34.
289. G.R.T. Hendry, Ramsey Numbers for Graphs with Five Vertices, Journal of Graph Theory, 13 (1989) 245-248.
290. 4), Utilitas Mathematica, 35 (1989) 40-54
291. addendum in 36 (1989) 25-32.
292. G.R.T. Hendry, Critical Colorings for Clancy's Ramsey Numbers, Utilitas Mathematica, 41 (1992) 181-203.
293. 5), Quaestiones Mathematica, 17 (1994) 249-258.
294. G.R.T. Hendry, see also [YH].
295. R. Hill and R.W. Irving, On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers, European Journal of Combinatorics, 3 (1982) 35-50.
296. J. Hirschfeld, A Lower Bound for Ramsey's Theorem, Discrete Mathematics, 32 (1980) 89-91.
297. M. Hoeth and I. Mengersen, Ramsey Numbers for Graphs of Order Four versus Connected Graphs of Order Six, Utilitas Mathematica, 57 (2000) 3-19.
298. Huang Da Ming and Song En Min, Properties and Lower Bounds of the Third Order Ramsey Numbers (in Chinese), Mathematica Applicata, 9 (1996) 105-107.
299. Huang Guotai, Some Generalized Ramsey Numbers (in Chinese), Mathematica Applicata, 1 (1988) 97-101.
300. Huang Guotai, An Unsolved Problem of Gould and Jacobson (in Chinese), Mathematica Applicata, 9 (1996) 234-236.
301. Huang Jian, see [HWSYZH].
302. Huang Wenke, see [DuHu].
303. also abbreviated by HW+ Huang Yi Ru, Wang Yuandi, Sheng Wancheng, Yang Jiansheng, Zhang Ke Min and Huang Jian, New Upper Bound Formulas with Parameters for Ramsey Numbers, Discrete Mathematics, 307 (2007) 760-763.
304. Huang Yi Ru, Yang Jian Sheng and Zhang Ke Min, A Note on Ramsey Numbers with Two Parameters, European Journal of Combinatorics, 27 (2006) 574-576.
305. Huang Yi Ru and Zhang Ke Min, An New Upper Bound Formula for Two Color Classical Ramsey Numbers, Journal of Combinatorial Mathematics and Combinatorial Computing, 28 (1998) 347-350.
306. Huang Yi Ru and Zhang Ke Min, New Upper Bounds for Ramsey Numbers, European Journal of Combinatorics, 19 (1998) 391-394.
307. Huang Yi Ru, see also [BJYHRZ, YHZ1, YHZ2].
308. R.W. Irving, Generalised Ramsey Numbers for Small Graphs, Discrete Mathematics, 9 (1974) 251-264.
309. R.W. Irving, see also [HiIr].
310. J.R. Isbell, N(4,4; 3) ≥ 13, Journal of Combinatorial Theory, 6 (1969) 210.
311. J.R. Isbell, N(5,4; 3) ≥ 24, Journal of Combinatorial Theory, Series A, 34 (1983) 379-380.
312. Y. Ishigami, Linear Ramsey Numbers for Bounded-Degree Hypergraphs, Electronic Notes in Discrete Mathematics, 29 (2007) 47-51.
313. M.S. Jacobson, On the Ramsey Number for Stars and a Complete Graph, Ars Combinatoria, 17 (1984) 167-172.
314. M.S. Jacobson, see also [BEFRSGJ, GoJa1, GoJa2].
315. 8), SUT Journal of Mathematics, 43 (2007) 85-98.
316. 7), International Journal of Pure and Applied Mathematics, 41 (2007) 667-677.
317. 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.
318. 6,G) for All Graphs G of Order Less than Six, Congressus Numerantium, 136 (1999) 147-159.
319. 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.
320. Erratum in 51 (2004) 221.
321. C.J. Jayawardene and C.C. Rousseau, Ramsey Numbers r (C5,G) for All Graphs G of Order Six, Ars Combinatoria, 57 (2000) 163-173.
322. 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.
323. C.J. Jayawardene, see also [BJYHRZ, RoJa1, RoJa2].
324. Jiang Baoqi, see [SunYJLS].
325. Jin Xia, Ramsey Numbers Involving a Triangle: Theory & Applications, Technical Report RIT-TR-93-019, MS thesis, Department of Computer Science, Rochester Institute of Technology, 1993.
326. Jin Xia, see also [RaJi].
327. Special volume on Ramsey theory of the Journal of Graph Theory, 7, Number 1, (1983).
328. J.G. Kalbfleisch, Construction of Special Edge-Chromatic Graphs, Canadian Mathematical Bulletin, 8 (1965) 575-584.
329. J.G. Kalbfleisch, Chromatic Graphs and Ramsey's Theorem, Ph.D. thesis, University of Waterloo, January 1966.
330. J.G. Kalbfleisch, On Robillard's Bounds for Ramsey Numbers, Canadian Mathematical Bulletin, 14 (1971) 437-440.
331. J.G. Kalbfleisch and R.G. Stanton, On the Maximal Triangle-Free Edge-Chromatic Graphs in Three Colors, Journal of Combinatorial Theory, 5 (1968) 9-20.
332. G. Károlyi and V. Rosta, Generalized and Geometric Ramsey Numbers for Cycles, Theoretical Computer Science, 263 (2001) 87-98.
333. M. Kerber and C. Rowan, CommonLisp program for computing upper bounds on classical Ramsey numbers, http://www.cs.bham.ac.uk/~mmk/demos/ramsey-upper-limit.lisp (2009).
334. G. Kéry, On a Theorem of Ramsey (in Hungarian), Matematikai Lapok, 15 (1964) 204-224.
335. 2/log t, Random Structures and Algorithms, 7 (1995) 173-207.
336. 3 versus (p, q)-Graphs, Ars Combinatoria, 43 (1996) 107-120.
337. 4), Utilitas Mathematica, 52 (1997) 65-81.
338. K. Klamroth, see also [AKM].
339. M. Klawe, see [GHK].
340. D.J. Kleitman, see [GK].
341. Y. Kohayakawa, M. Simonovits and J. Skokan, The 3-colored Ramsey Number of Odd Cycles, Electronic Notes in Discrete Mathematics, 19 (2005) 397-402.
342. W. Köhler, On a Conjecture by Grossman, Ars Combinatoria, 23 (1987) 103-106.
343. J. Komlós, see [CsKo, AKS].
344. A. Korolova, Ramsey Numbers of Stars versus Wheels of Similar Sizes, Discrete Mathematics, 292 (2005) 107-117.
345. A.V. Kostochka and V. Rödl, On Graphs with Small Ramsey Numbers, Journal of Graph Theory, 37 (2001) 198-204.
346. A.V. Kostochka and V. Rödl, On Graphs with Small Ramsey Numbers, II, Combinatorica, 24 (2004) 389-401.
347. A.V. Kostochka and V. Rödl, On Ramsey Numbers of Uniform Hypergraphs with Given Maximum Degree, Journal of Combinatorial Theory, Series A, 113 (2006) 1555-1564.
348. A.V. Kostochka and B. Sudakov, On Ramsey Numbers of Sparse Graphs, Combinatorics, Probability and Computing, 12 (2003) 627-641.
349. R.L. Kramer, see [FKR].
350. I. Krasikov and Y. Roditty, On Some Ramsey Numbers of Unicyclic Graphs, Bulletin of the Institute of Combinatorics and its Applications, 33 (2001) 29-34.
351. S. Krause, see [HaKr].
352. D.L. Kreher, Li Wei and S.P. Radziszowski, Lower Bounds for Multi-Colored Ramsey Numbers From Group Orbits, Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 87-95.
353. D.L. Kreher, see also [RK1, RK2, RK3, RK4].
354. M. Krivelevich, Bounding Ramsey Numbers through Large Deviation Inequalities, Random Structures and Algorithms, 7 (1995) 145-155.
355. M. Krivelevich, see also [AlKS].
356. M. Kubale, see [DzKP].
357. D. Kühn, O. Cooley, N. Fountoulakis and D. Osthus, Ramsey Numbers of Sparse Hypergraphs, Electronic Notes in Discrete Mathematics, 29 (2007) 29-33.
358. D. Kühn, see also [CooFKO].
359. P.C.B. Lam, see [ShiuLL].
360. S.L. Lawrence, Cycle-Star Ramsey Numbers, Notices of the American Mathematical Society, 20 (1973) Abstract A- 420.
361. S.L. Lawrence, Bipartite Ramsey Theory, Notices of the American Mathematical Society, 20 (1973) Abstract A-562.
362. S.L. Lawrence, see also [FLPS].
363. 16's, Journal of Combinatorial Theory, Series B, 45 (1988) 120-124.
364. F. Lazebnik and D. Mubayi, New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs, Advances in Applied Mathematics, 28 (2002) 544-559.
365. 4), Journal of Combinatorial Theory, Series B, 79 (2000) 172-176.
366. F. Lazebnik and A. Woldar, General Properties of Some Families of Graphs Defined by Systems of Equations, Journal of Graph Theory, 38 (2001) 65-86.
367. H. Lefmann, Ramsey Numbers for Monotone Paths and Cycles, Ars Combinatoria, 35 (1993) 271-279.
368. H. Lefmann, see also [DLR].
369. J. Lehel, see [BaLS].
370. A. Lesser, Theoretical and Computational Aspects of Ramsey Theory, Examensarbeten i Matematik, Matematiska Institutionen, Stockholms Universitet, 3 (2001).
371. D. Leven, see [BLR].
372. Li Bingxi, see [SunYWLX, SunYXL].
373. 4) (in Chinese), Journal of Shanghai Tiedao University, 20 (1999) 66-70, 83.
374. 5), Journal of Combinatorial Mathematics and Combinatorial Computing, 45 (2003) 245-252.
375. Li Guiqing, see [SLLL, SLZL].
376. Li Jinwen, see [ZLLS].
377. Li Qiao, see [SLL, SLLL].
378. Li Wei, see [KLR].
379. Yusheng L.sheng, Some Ramsey Numbers of Graphs with Bridge, Journal of Combinatorial Mathematics and Combinatorial Computing, 25 (1997) 225-229.
380. Yusheng Li, Ramsey Numbers of a Cycle, Taiwanese Journal of Mathematics, 12 (2008) 1007-1013.
381. Yusheng Li, The Multi-Color Ramsey Number of an Odd Cycle, to appear in the Journal of Graph Theory, published online 2009.
382. Yusheng Li and Ko-Wei Lih, Multi-Color Ramsey Numbers of Even Cycles, European Journal of Combinatorics, 30 (2009) 114-118.
383. Yusheng L.sheng and C.C. Rousseau, On Book-Complete Graph Ramsey Numbers, Journal of Combinatorial Theory, Series B, 68 (1996) 36-44.
384. Yusheng L.sheng and C.C. Rousseau, Fan-Complete Graph Ramsey Numbers, Journal of Graph Theory, 23 (1996) 413-420.
385. n), Discrete Mathematics, 170 (1997) 265-267.
386. Yusheng L.sheng and C.C. Rousseau, A Ramsey Goodness Result for Graphs with Many Pendant Edges, Ars Combinatoria, 49 (1998) 315-318.
387. Yusheng L.sheng, C.C. Rousseau and L. Soltés, Ramsey Linear Families and Generalized Subdivided Graphs, Discrete Mathematics, 170 (1997) 269-275.
388. Yusheng L.sheng, C.C. Rousseau and Zang Wenan, Asymptotic Upper Bounds for Ramsey Functions, Graphs and Combinatorics, 17 (2001) 123-128.
389. Yusheng L.sheng, C.C. Rousseau and Zang Wenan, An Upper Bound on Ramsey Numbers, Applied Mathematics Letters, 17 (2004) 663-665.
390. Yusheng Li and Jian Shen, Bounds for Ramsey Numbers of Complete Graphs Dropping an Edge, European Journal of Combinatorics, 29 (2008) 88-94.
391. m,n with n Large, Discrete Mathematics, 300 (2005) 120-128.
392. Yusheng L.sheng and Zang Wenan, Ramsey Numbers Involving Large Dense Graphs and Bipartite Turán Numbers, Journal of Combinatorial Theory, Series B, 87 (2003) 280-288.
393. Yusheng L.sheng and Zang Wenan, The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers, Journal of Combinatorial Optimization, 7 (2003) 353-359.
394. Yusheng L.sheng, see also [BaiLi, BaLX, CLRZ, DoLL, GuLi, LinLi, ShiuLL, SunLi].
395. Li Zhenchong, see [LSL, LSWL].
396. Ko-Wei Lih, see [LiLih].
397. A. Lin and J. Mackey, Counting Triangles in Some Ramsey Graphs, RIT Technical Report, April (2009), https://ritdml.rit.edu/dspace/handle/1850/8816.
398. Qizhong Lin and Yusheng Li, On Ramsey Numbers of Fans, Discrete Applied Mathematics, 157 (2009) 191-194.
399. Qizhong Lin, see also [DoLL].
400. Lin Xiaohui, see [SunYJLS, SunYLZ1, SunYLZ2].
401. B. Lindström, Undecided Ramsey-Numbers for Paths, Discrete Mathematics, 43 (1983) 111-112.
402. A.C.H. Ling, Some Applications of Combinatorial Designs to Extremal Graph Theory, Ars Combinatoria, 67 (2003) 221-229.
403. Andy Liu, see [AbbL].
404. Liu Linzhong, see [ZLLS].
405. Liu Shu Yan, see [SoBL].
406. Liu Xiangyang, see [GuSL].
407. Liu Yanwu, see [SoYL].
408. S.C. Locke, Bipartite Density and the Independence Ratio, Journal of Graph Theory, 10 (1986) 47-53.
409. S.C. Locke, see also [FrLo].
410. P.J. Lorimer, The Ramsey Numbers for Stripes and One Complete Graph, Journal of Graph Theory, 8 (1984) 177-184.
411. P.J. Lorimer and P.R. Mullins, Ramsey Numbers for Quadrangles and Triangles, Journal of Combinatorial Theory, Series B, 23 (1977) 262-265.
412. P.J. Lorimer and R.J. Segedin, Ramsey Numbers for Multiple Copies of Complete Graphs, Journal of Graph Theory, 2 (1978) 89-91.
413. P.J. Lorimer and W. Solomon, The Ramsey Numbers for Stripes and Complete Graphs 1, Discrete Mathematics, 104 (1992) 91-97.
414. Corrigendum in Discrete Mathematics, 131 (1994) 395.
415. P.J. Lorimer, see also [CL1, CL2].
416. 3,n, Discrete Mathematics, 306 (2006) 2976-2982.
417. 2,n), Utilitas Mathematica, 61 (2002) 87-95.
418. R. Lortz and I. Mengersen, Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs, Results in Mathematics, 41 (2002) 140-149.
419. 2,n), Journal of Graph Theory, 43 (2003) 252-268.
420. R. Lortz and I. Mengersen, Further Ramsey Numbers for Small Complete Bipartite Graphs, Ars Combinatoria, 79 (2006) 195-203.
421. n) ≤ (4 + o (1)) n, Journal of Combinatorial Theory, Series B, 75 (1999) 174-187.
422. T. Łuczak, see also [FiŁu, HaŁP1+, HaŁP2+, HaŁT].
423. Luo Haipeng, Su Wenlong and Li Zhenchong, The Properties of Self-Complementary Graphs and New Lower Bounds for Diagonal Ramsey Numbers, Australasian Journal of Combinatorics, 25 (2002) 103-116.
424. Luo Haipeng, Su Wenlong and Shen Yun-Qiu, New Lower Bounds of Ten Classical Ramsey Numbers, Australasian Journal of Combinatorics, 24 (2001) 81-90.
425. Luo Haipeng, Su Wenlong and Shen Yun-Qiu, New Lower Bounds for Two Multicolor Classical Ramsey Numbers, Radovi Matematic ̌ki, 13 (2004) 15-21.
426. Luo Haipeng, Su Wenlong, Wu Kang and Li Zhenchong, Two New Lower Bounds for Ramsey Numbers R (3, q) Based on the Parallel Algorithm (in Chinese), Journal of Guangxi Academy of Sciences, 19, 4 (2003) 145-149.
427. Luo Haipeng, see also [SL, SLL, SLLL, SLZL, WSLX1, WSLX2].
428. J. Mackey, Combinatorial Remedies, Ph.D. Thesis, Department of Mathematics, University of Hawaii, 1994.
429. J. Mackey, see also [LinMac].
430. R. Mathon, Lower Bounds for Ramsey Numbers and Association Schemes, Journal of Combinatorial Theory, Series B, 42 (1987) 122-127.
431. J.P. Mayberry, see [LayMa].
432. C. McDiarmid and A. Steger, Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers, Journal of Combinatorial Theory, Series A, 74 (1996) 147-152.
433. B.D. McKay, Australian National University, personal communication (2003). Graphs available at http://cs.anu.edu.au/people/bdm/data/ramsey.html.
434. B.D. McKay, K. Piwakowski and S.P. Radziszowski, Ramsey Numbers for Triangles versus Almost- Complete Graphs, Ars Combinatoria, 73 (2004) 205-214.
435. 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.
436. B.D. McKay and S.P. Radziszowski, A New Upper Bound for the Ramsey Number R (5, 5), Australasian Journal of Combinatorics, 5 (1992) 13-20.
437. B.D. McKay and S.P. Radziszowski, Linear Programming in Some Ramsey Problems, Journal of Combinatorial Theory, Series B, 61 (1994) 125-132.
438. B.D. McKay and S.P. Radziszowski, R (4, 5) = 25, Journal of Graph Theory, 19 (1995) 309-322.
439. B.D. McKay and S.P. Radziszowski, Subgraph Counting Identities and Ramsey Numbers, Journal of Combinatorial Theory, Series B, 69 (1997) 193-209.
440. B.D. McKay and Zhang Ke Min, The Value of the Ramsey Number R (3,8), Journal of Graph Theory, 16 (1992) 99-105.
441. B.D. McKay, see also [FM].
442. J. McNamara, SUNY Brockport, personal communication (1995).
443. J. McNamara and S.P. Radziszowski, The Ramsey Numbers R (K4 - e,K6 - e) and R (K4 - e,K7 - e), Congressus Numerantium, 81 (1991) 89-96.
444. I. Mengersen and J. Oeckermann, Matching-Star Ramsey Sets, Discrete Applied Mathematics, 95 (1999) 417-424.
445. I. Mengersen, see also [AKM, CEHMS, EHM1, EHM2, HoMe, HaMe1, HaMe2, HaMe3, HaMe4, KM1, KM2, LoM1, LoM2, LoM3, LoM4].
446. Zhengke Miao, see [ChenCMN].
447. M. Miller, see [BSNM].
448. H. Mizuno and I. Sato, Ramsey Numbers for Unions of Some Cycles, Discrete Mathematics, 69 (1988) 283-294.
449. E.L. Monte Carmelo, Configurations in Projective Planes and Quadrilateral-Star Ramsey Numbers, Discrete Mathematics, 308 (2008) 3986-3991.
450. E.L. Monte Carmelo, see also [GoMC].
451. D. Mubayi, see [AFM, LaMu].
452. P.R. Mullins, see [LorMu].
453. S.M. Nababan, see [BSNM].
454. B. Nagle, S. Olsen, V. Rödl and M. Schacht, On the Ramsey Number of Sparse 3-Graphs, Graphs and Combinatorics, 24 (2008) 205-228.
455. J. Nesetril, Ramsey Theory, chapter 25 in Handbook of Combinatorics, ed. R.L. Graham, M. Grötschel and L. Lovász, The MIT-Press, Vol. II, 1996, 1331-1403.
456. J. Nesetril, see also [GrNe].
457. C.T. Ng, see [ChenCMN, ChenCN, CheCZN].
458. V. Nikiforov, The Cycle-Complete Graph Ramsey Numbers, Combinatorics, Probability and Computing, 14 (2005) 349-370.
459. V. Nikiforov and C.C. Rousseau, Large Generalized Books Are p -Good, Journal of Combinatorial Theory, Series B, 92 (2004) 85-97.
460. V. Nikiforov and C.C. Rousseau, Book Ramsey Numbers I, Random Structures and Algorithms, 27 (2005) 379-400.
461. V. Nikiforov and C.C. Rousseau, A Note on Ramsey Numbers for Books, Journal of Graph Theory, 49 (2005) 168-176.
462. V. Nikiforov and C.C. Rousseau, Ramsey Goodness and Beyond, to appear in Combinatorica.
463. V. Nikiforov, C.C. Rousseau and R.H. Schelp, Book Ramsey Numbers and Quasi-Randomness, Combinatorics, Probability and Computing, 14 (2005) 851-860.
464. A. Nowik, see [DzNS].
465. J. Oeckermann, see [MO].
466. S. Olsen, see [NaORS].
467. D. Osthus, see [CooFKO, KüCFO].
468. Linqiang Pan, see [ShaXBP, ShaXP, ShaXSP].
469. n), Discrete Mathematics, 6 (1973) 159-162.
470. T.D. Parsons, Path-Star Ramsey Numbers, Journal of Combinatorial Theory, Series B, 17 (1974) 51-58.
471. T.D. Parsons, Ramsey Graphs and Block Designs, I, Transactions of the American Mathematical Society, 209 (1975) 33-44.
472. T.D. Parsons, Ramsey Graphs and Block Designs, Journal of Combinatorial Theory, Series A, 20 (1976) 12-19.
473. T.D. Parsons, Graphs from Projective Planes, Aequationes Mathematica, 14 (1976) 167-189.
474. T.D. Parsons, Ramsey Graph Theory, in Selected Topics in Graph Theory, (L.W. Beineke and R.J. Wilson eds.), Academic Press, (1978) 361-384.
475. T.D. Parsons, see also [FLPS].
476. Y. Peng, see [HaP1+, HaP2+].
477. O. Pikhurko, see [BePi].
478. K. Piwakowski, Applying Tabu Search to Determine New Ramsey Graphs, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R6, 3 (1996), 4 pages.
479. K. Piwakowski, A New Upper Bound for R3(K4 - e), Congressus Numerantium, 128 (1997) 135-141.
480. K. Piwakowski and S.P. Radziszowski, 30 ≤ R (3,3,4) ≤ 31, Journal of Combinatorial Mathematics and Combinatorial Computing, 27 (1998) 135-141.
481. K. Piwakowski and S.P. Radziszowski, Towards the Exact Value of the Ramsey Number R (3,3,4), Congressus Numerantium, 148 (2001) 161-167.
482. K. Piwakowski, see also [MPR, DzKP].
483. J. Polcyn, V. Rödl, A. Ruciński and E. Szemerédi, Short Paths in Quasi-Random Triple Systems with Sparse Underlying Graphs, Journal of Combinatorial Theory, Series B, 96 (2006) 584-607.
484. A.D. Polimeni, see [CGP, CRSPS].
485. L.M. Pretorius, see [SwPr].
486. P. Pudlák, see [AlPu, CPR].
487. Qian Xinjin, see [SoGQ].
488. 9 - e), Journal of Combinatorial Mathematics and Combinatorial Computing, 8 (1990) 137-145.
489. S.P. Radziszowski, Small Ramsey Numbers, Technical Report RIT-TR-93-009, Department of Computer Science, Rochester Institute of Technology (1993).
490. 5 - e), Ars Combinatoria, 36 (1993) 225-232.
491. S.P. Radziszowski and Jin Xia, Paths, Cycles and Wheels in Graphs without Antitriangles, Australasian Journal of Combinatorics, 9 (1994) 221-232.
492. S.P. Radziszowski and D.L. Kreher, Search Algorithm for Ramsey Graphs by Union of Group Orbits, Journal of Graph Theory, 12 (1988) 59-72.
493. 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.
494. S.P. Radziszowski and D.L. Kreher, On R (3, k) Ramsey Graphs: Theoretical and Computational Results, Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 37-52.
495. S.P. Radziszowski and D.L. Kreher, Minimum Triangle-Free Graphs, Ars Combinatoria, 31 (1991) 65-92.
496. S.P. Radziszowski and Kung-Kuen Tse, A Computational Approach for the Ramsey Numbers R (C4,Kn), Journal of Combinatorial Mathematics and Combinatorial Computing, 42 (2002) 195-207.
497. S.P. Radziszowski, J. Stinehour and Kung-Kuen Tse, Computation of the Ramsey Number R (W5,K5), Bulletin of the Institute of Combinatorics and its Applications, 47 (2006) 53-57.
498. S.P. Radziszowski, see also [BaRT, BLR, FKR, KLR, MPR, MR1, MR2, MR3, MR4, MR5, McR, PR1, PR2, XuR1, XuR2, XSR1, XSR2, XXER, XXR].
499. F.P. Ramsey, On a Problem of Formal Logic, Proceedings of the London Mathematical Society, 30 (1930) 264-286.
500. Ramsey@Home, A distributed computing project searching for lower bounds for Ramsey numbers, http://www.ramseyathome.com/ramsey (2009).
501. 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.
502. G. Resta, see [CPR].
503. S.W. Reyner, see [BR].
504. D.F. Reynolds, see [ExRe].
505. F.S. Roberts, Applied Combinatorics, Prentice-Hall, Englewood Cliffs, 1984.
506. J.A. Roberts, see [BuRo1, BuRo2].
507. S. Roberts, see [GR].
508. A. Robertson, New Lower Bounds for Some Multicolored Ramsey Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R12, 6 (1999), 6 pages.
509. A. Robertson, Difference Ramsey Numbers and Issai Numbers, Advances in Applied Mathematics, 25 (2000) 153-162.
510. A. Robertson, New Lower Bounds Formulas for Multicolored Ramsey Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org/, #R13, 9 (2002), 6 pages.
511. Y. Roditty, see [KrRod].
512. V. Rödl and R. Thomas, Arrangeability and Clique Subdivisions, in The Mathematics of Paul Erdös II, 236-239, Algorithms and Combinatorics 14, Springer, Berlin, 1997.
513. V. Rödl, see also [AlRö, CRST, DLR, GrRö, GRR1, GRR2, HaP1+, HaP2+, KoRö1, KoRö2, KoRö3, NaORS, PoRRS].
514. 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.
515. V. Rosta, Ramsey Theory Applications, Dynamic Survey in Electronic Journal of Combinatorics, http://www.combinatorics.org/Surveys, #DS13, (2004), 43 pages.
516. V. Rosta, see also [BuRo3, KáRos].
517. B.L. Rothschild, see [GRS].
518. C.C. Rousseau, personal communication, (2006).
519. 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.
520. C.C. Rousseau and C.J. Jayawardene, Harary's Problem for K2,k, unpublished manuscript, (1999).
521. C.C. Rousseau and J. Sheehan, On Ramsey Numbers for Books, Journal of Graph Theory, 2 (1978) 77-87.
522. C.C. Rousseau and J. Sheehan, A Class of Ramsey Problems Involving Trees, Journal of the London Mathematical Society (2), 18 (1978) 392-396.
523. C.C. Rousseau, see also [BJYHRZ, BEFRS1, BEFRS2, BEFRS3, BEFRS4, BEFRS5, BEFRSGJ, CLRZ, CRSPS, EFRS1, EFRS2, EFRS3, EFRS4, EFRS5, EFRS6, EFRS7, EFRS8, EFRS9, FRS1, FRS2, FRS3, FRS4, FRS5, FRS6, FRS7, FRS8, FSR, JR1, JR2, JR3, JR4, JR5, LR1, LR2, LR3, LR4, LRS, LiRZ1, LiRZ2, NiRo1, NiRo2, NiRo3, NiRo4, NiRS].
524. C. Rowan, see [KerRo].
525. P. Rowlinson, see [YR1, YR2, YR3].
526. A. Rucin ́ski, see [GRR1, GRR2, HaŁP1+, HaŁP2+, PoRRS].
527. M. Ruszinkó, see [GyRSS].
528. A.N.M. Salman and H.J. Broersma, The Ramsey Numbers of Paths versus Kipases, Electronic Notes in Discrete Mathematics, 17 (2004) 251-255.
529. A.N.M. Salman and H.J. Broersma, Paths-Fan Ramsey Numbers, Discrete Applied Mathematics, 154 (2006) 1429-1436.
530. A.N.M. Salman and H.J. Broersma, The Ramsey Numbers for Paths versus Wheels, Discrete Mathematics, 307 (2007) 975-982.
531. A.N.M. Salman and H.J. Broersma, Path-Kipas Ramsey Numbers, Discrete Applied Mathematics, 155 (2007) 1878-1884.
532. A. Sánchez-Flores, An Improved Bound for Ramsey Number N (3,3,3,3;2), Discrete Mathematics, 140 (1995) 281-286.
533. G.N. Sárközy, see [GyRSS, GySS].
534. I. Sato, see [MiSa].
535. M. Schacht, see [NaORS].
536. M. Schaefer, Graph Ramsey Theory and the Polynomial Hierarchy, Journal of Computer and System Sciences, 62 (2001) 290-322.
537. R.H. Schelp, see [BaLS, BaSS, BEFRS1, BEFRS2, BEFRS3, BEFRS4, BEFRS5, BEFRSGJ, BEFS, ChenS, EFRS1, EFRS2, EFRS3, EFRS4, EFRS5, EFRS6, EFRS7, EFRS8, EFRS9, FLPS, FRS1, FRS2, FRS3, FRS4, FRS5, FS1, FS2, FS3, FS4, FSR, FSS1, NiRS].
538. J. Schönheim, see [BS].
539. 3, G) for Connected Graphs G of Order Seven, Discrete Applied Mathematics, 79 (1997) 189-200.
540. 2, Discrete Mathematics, 191 (1998) 191-196.
541. A. Schelten, see also [FSS2].
542. 6), Journal of Graph Theory, 44 (2003) 251-260.
543. 7), Discussiones Mathematicae Graph Theory, 25 (2005) 129-139.
544. I. Schiermeyer, see also [FSS2, SchSch1, SchSch2].
545. C. -U. Schulte, Ramsey-Zahlen für Bäume und Kreise, Ph.D. thesis, Heinrich-Heine-Universität Düsseldorf, (1992).
546. S. Schuster, see [ChaS].
547. A. Schwenk, see [ChvS].
548. 3) and Related Results,., MA thesis, University of Louisville (1993).
549. R.J. Segedin, see [LorSe].
550. Zehui Shao, personal communication (2008).
551. Zehui Shao, Jin Xu, Qiquan Bao and Linqiang Pan, Computation of Some Generalized Ramsey Numbers, to appear in the Journal of Combinatorial Mathematics and Combinatorial Computing.
552. Zehui Shao, Jin Xu and Linqiang Pan, Lower Bounds on Ramsey Numbers R(6,8), R(7,9) and R (8,17), to appear in Ars Combinatoria.
553. k), European Journal of Combinatorics, 30 (2009) 396-403.
554. Zehui Shao, see also [XSR1, XSR2].
555. A. Shastri, Lower Bounds for Bi-Colored Quaternary Ramsey Numbers, Discrete Mathematics, 84 (1990) 213-216.
556. J.B. Shearer, Lower Bounds for Small Diagonal Ramsey Numbers, Journal of Combinatorial Theory, Series A, 42 (1986) 302-304.
557. J.B. Shearer, A Note on the Independence Number of Triangle-free Graphs II, Journal of Combina- torial Theory, Series B, 53 (1991) 300-307.
558. J.B. Shearer, Independence Numbers of Paley Graphs (data for primes 1 mod 4 up to 7000), http://www.research.ibm.com/people/s/shearer/indpal.html (1996).
559. J. Sheehan, see [CRSPS, CEHMS, FRS6, FRS7, FRS8, RS1, RS2].
560. Jian Shen, see [LiShen].
561. Shen Yun-Qiu, see [LSS1, LSS2].
562. Sheng Wancheng, see [HWSYZH].
563. Shi Lei, see [SunYJLS].
564. Shi Ling Sheng, Cube Ramsey Numbers Are Polynomial, Random Structures & Algorithms, 19 (2001) 99--101.
565. Shi Ling Sheng, Upper Bounds for Ramsey Numbers, Discrete Mathematics, 270 (2003) 251-265.
566. Shi Ling Sheng, Linear Ramsey Numbers of Sparse Graphs, Journal of Graph Theory, 50 (2005) 175-185.
567. Shi Lingsheng, The Tail Is Cut for Ramsey Numbers of Cubes, Discrete Mathematics, 307 (2007) 290-292.
568. Shi Ling Sheng and Zhang Ke Min, An Upper Bound Formula for Ramsey Numbers, manuscript, (2001).
569. Shi Ling Sheng and Zhang Ke Min, A Sequence of Formulas for Ramsey Numbers, manuscript, (2001).
570. Xiaolong Shi, see [ShaXSP].
571. Shiu Wai Chee, Peter Che Bor Lam and Li Yusheng, On Some Three-Color Ramsey Numbers, Graphs and Combinatorics, 19 (2003) 249-258.
572. A.F. Sidorenko, On Turán Numbers T (n, 5,4) and Number of Monochromatic 4-cliques in 2-colored 3-graphs (in Russian), Voprosy Kibernetiki, 64 (1980) 117-124.
573. A.F. Sidorenko, An Upper Bound on the Ramsey Number R (K3, G) Depending Only on the Size of the Graph G, Journal of Graph Theory, 15 (1991) 15-17.
574. A.F. Sidorenko, The Ramsey Number of an N -Edge Graph versus Triangle Is at Most 2N + 1, Journal of Combinatorial Theory, Series B, 58 (1993) 185-196.
575. M. Simonovits, see [BaSS, FSS1, FS, HaŁP1+, KoSS].
576. F. Siqueira Benevides and J. Skokan, The 3-Colored Ramsey Number of Even Cycles, Journal of Combinatorial Theory, Series B, 99 (2009) 690-708.
577. J. Skokan, see [HaŁP1+, HaŁP2+, KoSS, SiqSk].
578. M.J. Smuga-Otto, see [AbbS].
579. A. Sobczyk, Euclidian Simplices and the Ramsey Number R (4,4; 3), Technical Report #10, Clemson University (1967).
580. A. Soifer, The Mathematical Coloring Book, Springer, 2009.
581. W. Solomon, see [LorSo].
582. L. Soltés, see [LRS].
583. Song En Min, Study of Some Ramsey Numbers (in Chinese), a note (announcement of results without proofs), Mathematica Applicata, 4(2) (1991) 6.
584. Song En Min, New Lower Bound Formulas for the Ramsey Numbers N(k,k,.,k;2) (in Chinese), Mathematica Applicata, 6 (1993) suppl., 113-116.
585. Song En Min, An Investigation of Properties of Ramsey Numbers (in Chinese), Mathematica Appli- cata, 7 (1994) 216-221.
586. Song En Min, Properties and New Lower Bounds of the Ramsey Numbers R(p,q;4) (in Chinese), Journal of Huazhong University of Science and Technology, 23 (1995) suppl. II, 1-4.
587. Song En Min, Ye Weiguo and Liu Yanwu, New Lower Bounds for Ramsey Number R(p,q;4), Discrete Mathematics, 145 (1995) 343-346.
588. Song En Min, see also [HuSo, ZLLS].
589. Song Hongxue, Asymptotic Upper Bounds for Wheel-Complete Graph Ramsey Numbers, Journal of Southeast University (English Edition), ISSN 1003-7985, 20 (2004) 126-129.
590. Song Hong Xue, Bai Lu Feng and Liu Shu Yan, Asymptotic Upper Bounds for the Wheel-Complete Graph Ramsey Numbers (in Chinese), Acta Mathematica Scientia, Series A, ISSN 1003-3998, 26 (2006) 741-746.
591. n (in Chinese), Journal of Liaoning Normal University, Natural Science Edition, ISSN 1000-1735, 27 (2004) 142-145.
592. Song Hongxue, see also [GuSL].
593. J.H. Spencer, Ramsey's Theorem - A New Lower Bound, Journal of Combinatorial Theory, Series A, 18 (1975) 108-115.
594. J.H. Spencer, Asymptotic Lower Bounds for Ramsey Functions, Discrete Mathematics, 20 (1977/1978) 69-76.
595. J.H. Spencer, see also [BES, GRS].
596. T. Spencer, University of Nebraska at Omaha, personal communication (1993), and, Upper Bounds for Ramsey Numbers via Linear Programming, manuscript, (1994).
597. A.K. Srivastava, see [GauST].
598. S. Stahl, On the Ramsey Number R (F, Km) where F is a Forest, Canadian Journal of Mathematics, 27 (1975) 585-589.
599. R.G. Stanton, see [KaSt].
600. W. Staton, Some Ramsey-type Numbers and the Independence Ratio, Transactions of the American Mathematical Society, 256 (1979) 353-370.
601. A. Steger, see [McS].
602. J. Stinehour, see [RST].
603. S. Stevens, Ramsey Numbers for Stars versus Complete Multipartite Graphs, Congressus Numeran- tium, 73 (1990) 63-71.
604. M.J. Stewart, see [CRSPS].
605. J.C. Stone, Utilizing a Cancellation Algorithm to Improve the Bounds of R (5, 5), (1996), http://oas.okstate.edu/ojas/jstone.htm. This paper claims incorrectly that R (5,5) = 50.
606. Su Wenlong and Luo Haipeng, Prime Order Cyclic Graphs and New Lower Bounds for Three Classi- cal Ramsey Numbers R (4, n) (in Chinese), Journal of Mathematical Study, 31, 4 (1998) 442-446.
607. Su Wenlong, Luo Haipeng and Li Qiao, New Lower Bounds of Classical Ramsey Numbers R(4,12), R (5,11) and R (5,12), Chinese Science Bulletin, 43, 6 (1998) 528.
608. Su Wenlong, Luo Haipeng, Li Guiqing and Li Qiao, Lower Bounds of Ramsey Numbers Based on Cubic Residues, Discrete Mathematics, 250 (2002) 197-209.
609. Su Wenlong, Luo Haipeng, Zhang Zhengyou and Li Guiqing, New Lower Bounds of Fifteen Classi- cal Ramsey Numbers, Australasian Journal of Combinatorics, 19 (1999) 91-99.
610. Su Wenlong, see also [LSL, LSS1, LSS2, LSWL, WuCXS, WSLX1, WSLX2].
611. B. Sudakov, A Note on Odd Cycle-Complete Graph Ramsey Numbers, Electronic Journal of Com- binatorics, http://www.combinatorics.org/, #N1, 9 (2002), 4 pages.
612. s -free Graphs and Some Other Ramsey-Type Problems, Random Structures and Algorithms, 26 (2005) 253-265.
613. B. Sudakov, Ramsey Numbers and the Size of Graphs, SIAM Journal on Discrete Mathematics, 21 (2007) 980-986.
614. B. Sudakov, see also [AlKS, ConFS1, ConFS2, ConFS3, FoxSu1, FoxSu2, KoSu].
615. A. Sudan, see [GGS].
616. Sun Yongqi, Research on Ramsey Numbers of Some Graphs (in Chinese), Ph. D. thesis, Dalian University of Technology, China, July 2006.
617. 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.
618. 4), Utilitas Mathematica, 73 (2007) 33-44.
619. 4), Ars Combinatoria, 84 (2007) 3-11.
620. Sun Yongqi, Yang Yuansheng and Wang Zhihai, The Value of the Ramsey Number R5(C6), Utili- tas Mathematica, 76 (2008) 25-31.
621. Sun Yongqi, Yang Yuansheng, Wang Wei, Li Bingxi and Xu Feng, Study of Three Color Ramsey numbers R (Cm1, Cm2, Cm3) (in Chinese), Journal of Dalian University of Technology, ISSN 1000- 8608, 46 (2006) 428-433.
622. Sun Yongqi, Yang Yuansheng, Xu Feng and Li Bingxi, New Lower Bounds on the Multicolor Ram- sey Numbers R r (C2m), Graphs and Combinatorics, 22 (2006) 283-288.
623. Sun Yuqin and Li Yusheng, On an Upper Bound of Ramsey Number rk (Km,n) with Large n, Heilongjiang Daxue Ziran Kexue Xuebao, ISSN 1001-7011, 23 (2006) 668-670.
624. Surahmat, Cycle-Wheel Ramsey Numbers. Some results, open problems and conjectures. Math Track, ISSN 1817-3462, 1818-5495, 2 (2006) 56-64.
625. Surahmat and E.T. Baskoro, On the Ramsey Number of a Path or a Star versus W4 or W5, Proceed- ings of the 12-th Australasian Workshop on Combinatorial Algorithms, Bandung, Indonesia, July 14-17 (2001) 174-179.
626. Surahmat and E.T. Baskoro, The Ramsey Number of Linear Forest versus Wheel, paper presented at the 13-th Australasian Workshop on Combinatorial Algorithms, Fraser Island, Queensland, Australia, July 7-10, 2002.
627. Surahmat, E.T. Baskoro and H.J. Broersma, The Ramsey Numbers of Large Star-like Trees versus Large Odd Wheels, Technical Report #1621, Faculty of Mathematical Sciences, University of Twente, The Netherlands, (2002).
628. 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.integers-ejcnt.org/vol4.html, #A10, 4 (2004), 9 pages.
629. Surahmat, E.T. Baskoro and H.J. Broersma, The Ramsey Numbers of Fans versus K4, Bulletin of the Institute of Combinatorics and its Applications, 43 (2005) 96-102.
630. Surahmat, E.T. Baskoro and H.J. Broersma, The Ramsey Numbers of Large Star and Large Star-Like Trees versus Odd Wheels, Journal of Combinatorial Mathematics and Combinatorial Computing, 65 (2008) 153-162.
631. Surahmat, E.T. Baskoro and I. Tomescu, The Ramsey Numbers of Large Cycles versus Wheels, Discrete Mathematics, 306 (2006), 3334-3337.
632. Surahmat, E.T. Baskoro and I. Tomescu, The Ramsey Numbers of Large Cycles versus Odd Wheels, Graphs and Combinatorics, 24 (2008), 53-58.
633. Surahmat, E.T. Baskoro, I. Tomescu and H.J. Broersma, On Ramsey Numbers of Cycles with Respect to Generalized Even Wheels, manuscript, (2006).
634. 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.
635. Surahmat, see also [AliSur, BaSu, BSNM].
636. C.J. Swanepoel and L.M. Pretorius, Upper Bounds for a Ramsey Theorem for Trees, Graphs and Combinatorics, 10 (1994) 377-382.
637. M.M. Sweet, see [FreSw].
638. E. Szemerédi, see [AKS, CRST, GyRSS, GySS, PoRRS].
639. P. Szuca, see [DzNS].
640. Tang Xueqing, see [LiTZ].
641. R. Thomas, see [RöTh].
642. A. Thomason, An Upper Bound for Some Ramsey Numbers, Journal of Graph Theory, 12 (1988) 509-517.
643. P.W. Tingley, see [HaŁT].
644. I. Tomescu, see [AliBT, SuBT1, SuBT2, SuBTB].
645. C.A. Tovey, see [CET].
646. A. Tripathi, see [GauST].
647. Trivial results
648. W.T. Trotter Jr., see [CRST].
649. Kung-Kuen, Tse, On the Ramsey Number of the Quadrilateral versus the Book and the Wheel, Australasian Journal of Combinatorics, 27 (2003) 163-167.
650. n), Journal of Combinatorial Mathematics and Combinatorial Computing, 58 (2006) 97-100
651. r), Journal of Combinatorial Mathematics and Combinatorial Computing, 62 (2007) 189-192.
652. Kung-Kuen, Tse, see also [BaRT, RST, RT].
653. Z. Tuza, see [GyTu].
654. S. Uttunggadewa, see [SuBUB].
655. L. Volkmann, see [GuoV].
656. K. Walker, Dichromatic Graphs and Ramsey Numbers, Journal of Combinatorial Theory, 5 (1968) 238-243.
657. W.D. Wallis, On a Ramsey Number for Paths, Journal of Combinatorics, Information & System Sciences, 6 (1981) 295-296
658. Wan. Honghui, Upper Bounds for Ramsey Numbers R (3, 3, 3) and Schur Numbers, Journal of Graph Theory, 26 (1997) 119-122.
659. Wang Gongben, see [WW, WWY1, WWY2].
660. Wang Qingxian and Wang Gongben, New Lower Bounds of Ramsey Numbers r (3, q) (in Chinese), Acta Scientiarum Naturalium, Universitatis Pekinensis, 25 (1989) 117-121.
661. Wang Qingxian, Wang Gongben and Yan Shuda, A Search Algorithm And New Lower Bounds for Ramsey Numbers r (3, q), manuscript, (1994).
662. Wang Qingxian, Wang Gongben and Yan Shuda, The Ramsey Numbers R (K3,Kq - e) (in Chinese), Beijing Daxue Xuebao Ziran Kexue Ban, 34 (1998) 15-20.
663. Wang Wei, see [SunYWLX, SunYXL].
664. Wang Yuandi, see [HWSYZH].
665. Wang Zhihai, see [SunYW].
666. Wang Zhi Jian, see [LiWa1, LiWa2].
667. D. West, Introduction to Graph Theory, second edition, Prentice Hall, 2001
668. E.G. Whitehead, The Ramsey Number N(3,3,3,3; 2), Discrete Mathematics, 4 (1973) 389-396
669. E.R. Williams, see [AbbW].
670. R.M. Wilson, see [FraWi].
671. A. Woldar, see [LaWo1, LaWo2].
672. Wu Kang, Chen Hong, Xu Xiaodong and Su Wenlong, New Lower Bound for Nine Classical Ramsey Numbers R (3, t) (in Chinese), submitted
673. Wu Kang, Su Wenlong, Luo Haipeng and Xu Xiaodong, New Lower Bound for Seven Classical Ramsey Numbers R (3, q), Applied Mathematics Letters, 22 (2009) 365-368.
674. Wu Kang, Su Wenlong, Luo Haipeng and Xu Xiaodong, A Generalization of Generalized Paley Graphs and New Lower Bounds for R (3, q), manuscript, (2009).
675. Wu Kang, see also [LSWL].
676. Xie Jiguo and Zhang Xiaoxian, A New Lower Bound for Ramsey Number r (3,13) (in Chinese), Journal of Lanzhou Railway Institute, 12 (1993) 87-89.
677. Xie Zheng, see [XX1, XX2, XXER, XXR].
678. Jin Xu, see [ShaXBP, ShaXP]
679. Xu Feng, see [SunYWLX, SunYXL].
680. Ran Xu, see [ChenCX].
681. Xu Xiaodong, personal communication, (2004).
682. Xiaodong Xu and S.P. Radziszowski, An Improvement to Mathon's Cyclotomic Ramsey Colorings, Electronic Journal of Combinatorics, http://www.combinatorics.org, #N1, 16(1) (2009), 5 pages.
683. 4) ≤ 36, to appear in Utilitas Mathematica.
684. Xiaodong Xu, Zehui Shao and S.P. Radziszowski, Bounds on Some Ramsey Numbers Involving Quadrilateral, Ars Combinatoria, 90 (2009) 337-344.
685. Xiaodong Xu, Zehui Shao and S.P. Radziszowski, More Constructive Lower Bounds on Classical Ramsey Numbers, in preparation, (2009).
686. Xu Xiaodong and Xie Zheng, A Constructive Approach for the Lower Bounds on the Ramsey Numbers r (k, l), manuscript, (2002).
687. Xu Xiaodong and Xie Zheng, A Constructive Approach for the Lower Bounds on Multicolor Ramsey Numbers, manuscript, (2002).
688. Xu Xiaodong, Xie Zheng, G. Exoo and S.P. Radziszowski, Constructive Lower Bounds on Classical Multicolor Ramsey Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org/,#R35, 11 (2004), 24 pages.
689. Xu Xiaodong, Xie Zheng and S.P. Radziszowski, A Constructive Approach for the Lower Bounds on the Ramsey Numbers R (s, t), Journal of Graph Theory, 47 (2004) 231-239.
690. Xu Xiaodong, see also [ShaXSP, WuCXS, WSLX1, WSLX2].
691. Xu Zhiqiang, see [BaLX].
692. J. Yackel, see [GY].
693. Yan Shuda, see [WWY1, WWY2].
694. Yang Jian Sheng, results which can be obtained by the methods in [HWSYZH], personal communication, (2005).
695. 4) is 3(n - 1) + 1 (n ≥ 4), Australasian Journal of Combinatorics, 20 (1999) 205-206.
696. 5) = 25, European Journal of Combinatorics, 22 (2001) 561-567.
697. Yang Jian Sheng, see also [BJYHRZ, HWSYZH, HYZ].
698. Yang Yuansheng, On the Third Ramsey Numbers of Graphs with Six Edges, Journal of Combinatorial Mathematics and Combinatorial Computing, 17 (1995) 199-208.
699. 5 - e), Journal of Graph Theory, 19 (1995) 13-15.
700. 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.
701. Yang Yuansheng and P. Rowlinson, On Graphs without 6-Cycles and Related Ramsey Numbers, Utilitas Mathematica, 44 (1993) 192-196.
702. Yang Yuansheng and P. Rowlinson, The Third Ramsey Numbers for Graphs with at Most Four Edges, Discrete Mathematics, 125 (1994) 399-406.
703. Yang Yuansheng, see also [SunYJLS, SunYLZ1, SunYLZ2, SunYW, SunYWLX, SunYXL].
704. Ye Weiguo, see [SoYL].
705. Yu Song Nian, A Computer Assisted Number Theoretical Construction of (3, k)-Ramsey Graphs, Annales Universitatis Scientiarum Budapestinensis, Sect. Comput., 10 (1989) 35-44.
706. Yu Song Nian, Maximal Triangle-free Circulant Graphs and the Function K(c) (in Chinese), Journal of Shanghai University, Natural Science, 2 (1996) 678-682.
707. Zang Wenan, see [LiRZ1, LiRZ2, LiTZ, LiZa1, LiZa2].
708. Zeng Wei Bin, Ramsey Numbers for Triangles and Graphs of Order Four with No Isolated Vertex, Journal of Mathematical Research & Exposition, 6 (1986) 27-32.
709. Zhang Ke Min and Zhang Shu Sheng, Some Tree-Stars Ramsey Numbers, Proceedings of the Second Asian Mathematical Conference 1995, 287-291, World Sci. Publishing, River Edge, NJ, 1998.
710. Zhang Ke Min and Zhang Shu Sheng, The Ramsey Numbers for Stars and Stripes, Acta Mathematica Scientia, 25A (2005) 1067-1072.
711. Zhang Ke Min, see also [BJYHRZ, ChenZZ1, ChenZZ2, ChenZZ3, ChenZZ4, ChenZZ5, ChenZZ6, HWSYZH, HYZ, HZ1, HZ2, MZ, ShZ1, ShZ2, YHZ1, YHZ2, ZhaCZ1, ZhaCZ2, ZZ3].
712. Lianmin Zhang, Yaojun Chen and T.C. Edwin Cheng, The Ramsey Numbers for Cycles versus Wheels of Even Order, to appear in the European Journal of Combinatorics.
713. Zhang Shu Sheng, see [ZZ1, ZZ2].
714. Zhang Xiaoxian, see [XieZ].
715. Zhang Yuming, see [CLRZ].
716. Zhang Yunqing, On Ramsey Numbers of Short Paths versus Large Wheels, Ars Combinatoria, 89 (2008) 11-20.
717. Zhang Yunqing, The Ramsey Numbers for Stars of Odd Small Order versus a Wheel of Order Nine, Nanjing Daxue Xuebao Shuxue Bannian Kan, ISSN 0469-5097, 25 (2008) 35-40.
718. Yunqing Zhang, Yaojun Chen and Kemin Zhang, The Ramsey Numbers for Stars of Even Order versus a Wheel of Order Nine, European Journal of Combinatorics, 29 (2008) 1744-1754.
719. Yunqing Zhang, Yaojun Chen and Kemin Zhang, The Ramsey Numbers for Trees of High Degree versus a Wheel of Order Nine, manuscript, (2009).
720. 8), Discrete Mathematics, 309 (2009) 1084-1090.
721. Zhang Yunqing, see also [ChenCZ1, ChenCZ2, ChenZZ1, ChenZZ2, ChenZZ3, ChenZZ4, ChenZZ5, ChenZZ6, CheCZN].
722. Zhang Zhengyou, see [SLZL].
723. Zhang Zhongfu, Liu Linzhong, Li Jinwen and Song En Min, Some Properties of Ramsey Numbers, Applied Mathematics Letters, 16 (2003) 1187-1193.
724. Zheng Wenping, see [SunYLZ1, SunYLZ2].
725. Zhou Huai Lu, Some Ramsey Numbers for Graphs with Cycles (in Chinese), Mathematica Applicata, 6 (1993) 218.
726. Zhou Huai Lu, The Ramsey Number of an Odd Cycle with Respect to a Wheel (in Chinese), Journal of Mathematics, Shuxue Zazhi (Wuhan), 15 (1995) 119-120.
727. Zhou Huai Lu, On Book-Wheel Ramsey Number, Discrete Mathematics, 224 (2000) 239-249.