Skip to main content
SpringerLink
Log in

A New Lower Bound For A Ramsey-Type Problem

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

Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph on s vertices. The main aim of this paper is to provide a new lower bound on the size of the maximum subset of G without a copy of complete graph K r . Our results substantially improve previous bounds of Krivelevich and Bollobás and Hind.

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

Access this article

Log in via an institution

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 Mathematics, Princeton University and Institute for Advanced Study, Princeton, NJ 08540, USA

    Benny Sudakov*

Authors
  1. Benny Sudakov*
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benny Sudakov*.

Additional information

* Research supported in part by NSF grants DMS-0106589, CCR-9987845 and by the State of New Jersey. Part of this research was done while visiting Microsoft Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sudakov*, B. A New Lower Bound For A Ramsey-Type Problem. Combinatorica 25, 487–498 (2005). https://doi.org/10.1007/s00493-005-0029-3

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-005-0029-3

Mathematics Subject Classification (2000):

Search

Navigation