Premium
The multi‐color Ramsey number of an odd cycle
Author(s) -
Li Yusheng
Publication year - 2009
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20404
Subject(s) - ramsey's theorem , combinatorics , mathematics , graph , ramsey theory , discrete mathematics
Let r k ( G ) be the k ‐color Ramsey number of a graph G . It is shown that $r_{k}(C_{5})\le \sqrt{18^{k}\,k!}$ for k ⩾2 and that r k ( C 2 m + 1 )⩽( c k k !) 1/ m if the Ramsey graphs of r k ( C 2 m + 1 ) are not far away from being regular. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 324–328, 2009
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom