Skip to main content
Springer Nature Link
Log in

Size Ramsey Numbers of Stars Versus 3-chromatic Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Pure Mathematics and Mathematical Statistics, Cambridge University; Cambridge CB3 0WB, United Kingdom; E-mail: O.Pikhurko@dpmms.cam.ac.uk, , , , , , GB

    Oleg Pikhurko

Authors
  1. Oleg Pikhurko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received May 28, 1999

RID="*"

ID="*" Supported by an External Research Studentship, Trinity College, Cambridge, UK.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100004

Search

Navigation