An upper bound of 62 on the classical Ramsey number R(3,3,3,3)

Ars Combinatoria

Volumn 72, Issue , 2004, Pages 41-63

  Fettes, Susan E ^a   Kramer, Richard L ^b   Radziszowski, Stanislaw P ^c  

^a STATE UNIVERSITY OF NEW YORK AT OSWEGO   (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c Rochester Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26844436179     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. F. R. K. Chung, On The Ramsey Numbers N(3,3,...,3;2), Discrete Mathematics, 5 (1973), 317-321.
2. S. Fettes, On The Classical Ramsey Number R(3,3,3,3), Master's Thesis, Department of Computer Science, Rochester Institute of Technology (2001).
3. J. Folkman, Notes on the Ramsey Number N(3,3,3,3), Journal of Combinatorial Theory (A), 16 (1974), 371-379.
4. S. W. Golomb and L. D. Baumert, Backtrack Programming, Journal of the Association for Computing Machinery, Vol. 12, No. 4 (1965), 516-524.
5. R. E. Greenwood and A. M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955), 1-7.
6. 15, Journal of the Australian Mathematical Society, 24 (1977), 465-495.
7. 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.
8. R. L. Kramer, The Classical Ramsey Number R(3,3,3,3;2) is No Greater Than 62, manuscript, Iowa State University, 1994, current version at http://www.public.iastate.edu/~ricardo/ramsey.
9. 16's, Journal of Combinatorial Theory, Series B, 45 (1988), 120-124.
10. B. D. McKay, nauty users' guide (version 1.5), Technical report TR-CS-90-02, Computer Science Department, Australian National University, 1990, source code at http://cs.anu.edu.au/people/bdm/nauty.
11. K. Piwakowski and S. P. Radziszowski, 30 ≤ R(3,3,4) ≤ 31, The Journal of Combinatorial Mathematics and Combinatorial Computing, 27 (1998),135-141.
12. S. P. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics, Dynamic Survey 1, revision #8, July 2001, http://www. combinatorics.org.
13. A. T. Sánchez-Flores An improved upper bound for Ramsey number N(3,3,3,3;2), Discrete Mathematics, 140 (1995), 281-286.
14. E. G. Whitehead, The Ramsey Number N(3,3,3,3; 2), Discrete Mathematics, 4 (1973), 389-396.