The cycle-complete graph ramsey numbers

Combinatorics Probability and Computing

Volumn 14, Issue 3, 2005, Pages 349-370

  Nikiforov, V ^a  

^a University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; HAMILTONIANS; INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING; THEOREM PROVING;

2-CONNECTED GRAPHS; NONEMPTY GRAPHS; RAMSEY NUMBERS; SUBGRAPHS;

GRAPH THEORY;

EID: 18844397333     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830400642X     Document Type: Article

References (14)

1. Bollobás, B., Jayawardene, C., Yang, J., Huang, Y., Rousseau, C. C. and Zhang, K. (2000) On a conjecture involving cycle-complete graph Ramsey numbers. Australas. J. Combin. 22 63-71.
2. Bollobás, B. (1998) Modern Graph Theory, Vol. 184 of Graduate Texts in Mathematics, Springer, New York.
3. Bondy, J. A. (1995) Basic graph theory: Paths and circuits. Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam, pp. 3-110.
4. Burr, S., Erdos, P., Faudree, R. J., Rousseau, C. C. and Schelp, R. H. (1980) An extremal problem in generalized Ramsey theory. Ars Combinatoria 10 193-203.
5. Bondy, J. A. and Erdos, P. (1973) Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14 46-54.
6. Dirac, G. A. (1952) Some theorems on abstract graphs. Proc. London Math. Soc. 2 69-81.
7. Erdos, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hangar. 10 337-356.
8. Erdos, P., Faudree, R. J., Rousseau, C. C. and Schelp, R. H. (1978) On cycle-complete graph Ramsey numbers. J. Graph Theory 2 53-64.
9. Jayawardene, C. and Rousseau, C. C. (1997) The Ramsey number for a quadrilateral vs. a complete graph on six vertices. Congr. Numer. 123 97-108.
10. Jayawardene, C. and Rousseau, C. C. (2000) The Ramsey number for a cycle of length five vs. a complete graph of order six. J. Graph Theory 35 99-108.
11. Rousseau, C. C. Asymptotic bounds for Ramsey numbers. Preprint.
12. 6). J. Graph Theory 44 251-260.
13. 7). Preprint.
14. 4) is 3(n - 1) + 1 (n ≥ 4). Australas. J. Combin. 20 205-206.