DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

Journal Impact Factor (JIF 2022): 0.7

5-year Journal Impact Factor (2022): 0.7

CiteScore (2022): 1.9

SNIP (2022): 0.902

Discussiones Mathematicae Graph Theory

PDF

Discussiones Mathematicae Graph Theory 23(1) (2003) 141-158
DOI: https://doi.org/10.7151/dmgt.1191

THE RAMSEY NUMBER r(C7,C7,C7)

Ralph Faudree

Department of Mathematical Science
University of Memphis
Memphis, TN 38152, USA
e-mail: RFaudree@memphis.edu

 Annette Schelten and Ingo Schiermeyer

Fakultät für Mathematik und Informatik
Technische Universität Bergakademie Freiberg
09596 Freiberg, Germany
e-mail: Annette.Schelten@t-online.de
e-mail: Schierme@math.tu-freiberg.de

Abstract

Bondy and Erdős [2] have conjectured that the Ramsey number for three cycles Ck of odd length has value r(Ck,Ck,Ck)=4k−3. We give a proof that r(C7,C7,C7)=25 without using any computer support.

Keywords: Ramsey numbers, extremal graphs.

2000 Mathematics Subject Classification: 05C55, 05C35.

References

[1] A. Bialostocki and J. Schönheim, On Some Turan and Ramsey Numbers for C4, Graph Theory and Combinatorics, Academic Press, London, (1984) 29-33.
[2] J.A. Bondy and P. Erdős, Ramsey Numbers for Cycles in Graphs, J. Combin. Theory (B) 14 (1973) 46-54.
[3] S. Brandt, A Sufficient Condition for all Short Cycles, Discrete Applied Math. 79 (1997) 63-66.
[4] S. Brandt and H.J. Veldman, Degree sums for edges and cycle lengths in graphs, J. Graph Theory 25 (1997) 253-256.
[5] V. Chvátal, On Hamiltonian's Ideals, J. Combin. Theory (B) 12 (1972) 163-168.
[6] C. Clapham, The Ramsey Number r(C4,C4,C4), Periodica Mathematica Hungarica 18 (1987) 317-318.
[7] P. Erdős, On the Combinatorial Problems which I would most Like to See Solved, Combinatorica 1 (1981) 25-42.
[8] R.J. Faudree and R.H. Schelp, All Ramsey Numbers for Cycles in Graphs, Discrete Math. 8 (1974) 313-329.
[9] R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian J. Math. 7 (1995) 1-7.
[10] T. Łuczak, R(Cn,Cn,Cn) ≤ (4+o(1))n, J. Combin. Theory (B) 75 (1999) 174-187.
[11] S.P. Radziszowski, Small Ramsey Numbers, Electronic J. Combin. 1 (1994) update 2001.
[12] A. Schelten, Bestimmung von Ramsey-Zahlen zweier und dreier Graphen (Dissertation, TU Bergakademie Freiberg, 2000).
[13] P. Rowlinson amd Yang Yuangsheng, On the Third Ramsey Numbers of Graphs with Five Edges, J. Combin. Math. and Combin. Comp. 11 (1992) 213-222.
[14] P. Rowlinson and Yang Yuangsheng, On Graphs without 6-Cycles and Related Ramsey Numbers, Utilitas Mathematica 44 (1993) 192-196. 

Received 30 July 2001
Revised 18 January 2002

Close