All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8

Combinatorics Probability and Computing

Volumn 7, Issue 2, 1998, Pages 129-140

  Brinkmann, Gunnar ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032391032     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003337     Document Type: Article

References (20)

1. Berge, C. (1973) Graphs and Hypergraphs. North-Holland.
2. 5). In The Theory and Applications of Graphs (Kalamazoo, MI, 1980), Wiley, New York, pages 109-116.
3. Brandt, S., Brinkmann, G. and Harmuth, T. The generation of maximal triangle-free graphs. To appear in Graphs and Combinatorics.
4. Burr, A. A., Erdos, R, Faudree, R. J., Rousseau, C. C. and Schelp, R. H. (1980) An extremal problem in generalized Ramsey theory. Ars Combinatoria 10 193-203.
5. Chvátal, V. and Harary, F. (1972) Generalized Ramsey theory for graphs, II: small diagonal numbers. Proc. Amer. Math. Soc. 32 389-394.
6. Chvátal, V. and Harary, F. (1972) Generalized Ramsey theory for graphs, III: small off-diagonal numbers. Pacific J. Math. 41 335-345.
7. Clancy, M. (1977) Some small Ramsey numbers. J. Graph Theory 1 89-91.
8. 5 - e. Ars Combinatoria 25A 277-286.
9. Faudree, R. J., Rousseau, C. C. and Schelp, R. H. (1980) All triangle-graph Ramsey numbers for connected graphs of order six. J. Graph Theory 4 293-300.
10. Graver, J. E. and Yackel, J. (1968) Some graph theoretic results associated with Ramsey's theorem. J. Combin. Theory 4 125-175.
11. 2). J. Combinatorics, Information & System Sciences 7(2) 166-169.
12. Grinstead, C. and Roberts, S. (1982) On the Ramsey numbers r(3, 8) and r(3, 9). J. Combin. Theory, Ser. B 33 27-51.
13. 4). Utilitas Mathematica 35 40-54. Addendum in 36 (1989) 25-32.
14. Xia Jin (1993) Ramsey numbers involving a triangle: theory and applications. Master's thesis, Rochester Institute of Technology.
15. McKay, B. D. and Zhang Ke Min (1992) The value of the Ramsey number r(3, 8). J. Graph Theory 16(1) 99-105.
16. McKay, B. D. and Radziszowski, S. P. (1995) R(4, 5) = 25. J. Graph Theory 19(3) 309-322.
17. McKay, Brendan D. Isomorph free exhaustive generation. To appear in J. Algorithms.
18. Radziszowski, S. P. Small Ramsey numbers. Electronic Journal of Combinatorics. Dynamic survey, http://math34.gatech.edu:8080/Journal/ejcgeneral.html.
19. 9-e). J. Combinatorial Mathematics and Combinatorial Computing 8 137-145.
20. 3, G) for connected graphs of order seven. To appear in Discrete Appl. Math.