On some Ramsey and Turán-type numbers for paths and cycles

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-9

  Dzido, Tomasz ^a   Kubale, Marek ^b   Piwakowski, Konrad ^b  

^a UNIVERSITY OF GDA SK   (Poland)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746073024     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1081     Document Type: Article

References (12)

1. Arste J., Klamroth K., Mengersen I.: Three color Ramsey numbers for small graphs, Util. Math. 49 (1996) 85-96.
2. Bondy J.A., Erdos P.: Ramsey numbers for cycles in graphs, J. Combin. Theory Ser. B 14 (1973) 46-54.
3. Brandt S.: A sufficient condition for all short cycles, Disc. Appl. Math. 79 (1997) 63-66
4. Brandt S.: Sufficient conditions for graphs to contain all subgraphs of a given type, Ph.D. Thesis, Freie Universität Berlin, 1994.
5. Burr A., Erdos P.: Generalizations of a Ramsey-theoretic result of Chvatal, J. Graph Theory 7 (1983) 39-51.
6. Caccetta L., Vijayan K.: Maximal cycles in graphs, Disc. Math. 98 (1991) 1-7.
7. Dzido T.: Computer experience from calculating some 3-color Ramsey numbers, Technical Report of Gdańsk University of Technology, ETI Faculty 18/03 (2003).
8. Dzido T.: Multicolor Ramsey numbers for paths and cycles, Discuss. Math. Graph Theory 25 (2005) 57-65.
9. Faudree R.J., Schelp R.H.: Path Ramsey numbers in multicolor ings, J. Combin. Theory Ser. B 19 (1975) 150-160.
10. Greenwood R.E., Gleason A.M.: Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955) 1-7.
11. Radziszowski S.P.: Small Ramsey numbers, Electronic Journal of Combinatorics, Dynamic Survey 1, revision #10, July 2004, http://www. combinatorics.org.
12. Woodall D.R.: Maximal circuits of graphs I, Acta Math. Acad. Sci. Hungar. 28 (1976) 77-80.