The 3-colored Ramsey number of odd cycles

[1]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[2]  J. Moon.  On the Number of Complete Subgraphs of a Graph , 1965, Canadian Mathematical Bulletin.

[3]  M. Simonovits,et al.  An extremal graph problem , 1972 .

[4]  P. Erdös,et al.  Ramsey Numbers for Cycles in Graphs , 1973 .

[5]  V. Rosta.  On a ramsey-type problem of J. A. Bondy and P. Erdös. I , 1973 .

[6]  Richard H. Schelp,et al.  All Ramsey numbers for cycles in graphs , 1974, Discret. Math..

[7]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[8]  J. E. Williamson.  Panconnected graphs II , 1977 .

[9]  P. Erdos.  On the combinatorial problems which I would most like to see solved , 1981 .

[10]  M. Simonovits,et al.  On the number of complete subgraphs of a graph II , 1983 .

[11]  Endre Szemerédi,et al.  More results on Ramsey—Turán type problems , 1983, Comb..

[12]  Miklós Simonovits,et al.  Extremal subgraphs of random graphs , 1990, J. Graph Theory.

[13]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[14]  Tomasz Luczak,et al.  R(Cn, Cn, Cn)<=(4+o(1)) n , 1999, J. Comb. Theory, Ser. B.

[15]  ScienceDirect.  Electronic notes in discrete mathematics , 1999 .

[16]  Gyula Károlyi,et al.  Generalized and geometric Ramsey numbers for cycles , 2001, Theor. Comput. Sci..

[17]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[18]  Benny Sudakov,et al.  The Turán Number Of The Fano Plane , 2005, Comb..

[19]  M. Simonovits,et al.  On Triple Systems with Independent Neighbourhoods , 2005, Combinatorics, Probability and Computing.

[20]  Miklós Simonovits,et al.  Triple Systems Not Containing a Fano Configuration , 2005, Comb. Probab. Comput..

[21]  Tomasz Luczak,et al.  The Ramsey number for a triple of long even cycles , 2007, J. Comb. Theory, Ser. B.

[22]  P. Erdgs.  An Extremal Graph Problem , .