Let be the star with n edges, be the triangle, and be the family of odd cycles. We establish the following bounds on the corresponding size Ramsey numbers.
The upper (constructive) bound disproves a conjecture of Erdős.
Also we show that provided is an odd cycle of length o(n) or is a 3-chromatic graph of order o(log n).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received May 28, 1999
RID="*"
ID="*" Supported by an External Research Studentship, Trinity College, Cambridge, UK.
Rights and permissions
About this article
Cite this article
Pikhurko, O. Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. Combinatorica 21, 403–412 (2001). https://doi.org/10.1007/s004930100004
Issue Date:
DOI: https://doi.org/10.1007/s004930100004