Paper Info
Title
R(C n , C n , C n )<=(4+o(1)) n.
Abstract
It is shown that the Ramsey number R ( C n , C n , C n ) is bounded from above by (4+ o (1)) n . In particular, if n is odd then R ( C n , C n , C n )=(4+ o (1)) n . References REFERENCES 1 J.A. Bondy P. Erdős Ramsey numbers for cycles in graphs J. Comb. Theory 14 1973 46 54 2 P. Erdős On the combinatorial problems which I would most like to see solved Combinatorica 1 1981 25 42 3 P. Erdős T. Gallai On maximal paths and circuits of graphs Acta Math. Acad. Sci. Hungar. 10 1956 337 356 4 R.L. Graham B.L. Rothschild J.H. Spencer Ramsey Theory 1990 Wiley New York 5 J. Komlós G.N. Sárközy E. Szemerédi Blow-up lemma Combinatorica 17 1997 109 124 6 J. Komlós M. Simonovits Szemerédi's Regularity Lemma and its applications in graph theory Combinatorics, Paul Erdős is Eighty Bolyai Society Mathematical Studies 2 1996 p. 295–352 7 E. Szemerédi Regular partitions of graphs J.-C. Bermond J.-C. Fournier M. Las Vergnas D. Sotteau Problèmes Combinatoires et Théorie des Graphes, Proc. Colloque Inter. CNRS 1978 CNRS Paris 399 401
Year
DOI
Venue
1999
10.1006/jctb.1998.1874
Journal of Combinatorial Theory
DocType
Volume
Issue
Journal
75
2
ISSN
Citations 
PageRank 
0095-8956
11
1.27
References 
Authors
2
1
Name
Order
Citations
PageRank
Tomasz Łuczak122540.26