Ramsey numbers for triangles versus almost-complete graphs to the fond memory of Paul Erdos

Ars Combinatoria

Volumn 73, Issue , 2004, Pages 205-214

  McKay, Brendan D ^a   Piwakowski, Konrad ^b   Radziszowski, Stanisław P ^c  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c Rochester Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (16)

1. 3,G) for Connected Graphs of Order 9, Electronic Journal of Combinatorics, 5 (1998), 20 pages, http://www.combinatorics.org/.
2. V. Chvátal and F. Harary, Generalized Ramsey Theory for Graphs, III. Small Off-Diagonal Numbers, Pacific Journal of Mathematics, 41 (1972) 335-345.
3. M. Clancy, Some Small Ramsey Numbers, Journal of Graph Theory, 1 (1977) 89-91.
4. 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.
5. J. E. Graver and J. Yackel, Some Graph Theoretic Results Associated with Ramsey's Theorem, Journal of Combinatorial Theory, 4 (1968) 125-175.
6. 7-e), Journal of Combinatorics, Information & System Sciences, 7 (1982) 166-169.
7. C. Grinstead and S. Roberts, On the Ramsey Numbers R(3, 8) and R(3, 9), Journal of Combinatorial Theory, B 33 (1982) 27-51.
8. B. D. McKay, Nauty users' guide (version 1.5), Technical report TR-CS-90-02, Computer Science Department, Australian National University, 1990. Source code available at http://cs.anu.edu.au/people/bdm/nauty.
9. B. D. McKay, Autoson, a distributed batch system for UNIX work-station networks (Version 1.3), Technical Report TR-CS-96-03, Computer Science Department, Australian National University, 1996. Source code available at http://cs.anu.edu.au/people/bdm/autoson.
10. B. D. McKay and S. P. Radziszowski, Linear programming in some Ramsey problems, Journal of Combinatorial Theory, Series B, 61 (1994) 125-132.
11. B. D. McKay and Zhang Ke Min, The Value of the Ramsey Number R(3, 8), Journal of Graph Theory, 16 (1992) 99-105.
12. 9-e), Journal of Combinatorial Mathematics and Combinatorial Computing, 8 (1990) 137-145.
13. S. P. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics, Dynamic Survey 1, 1994-2002, http://www.combinatorics.org/.
14. S. P. Radziszowski and D. L. Kreher, On (3, k) Ramsey Graphs: Theoretical and Computational Results, Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 37-52.
15. 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.
16. q-e) (in Chinese), Beijing Daxue Xuebao Ziran Kexue Ban, 34 (1998) 15-20.