Skip to main content
SpringerLink
Log in

NOTE New Upper Bounds for a Canonical Ramsey Problem

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

f

(l,k) be the minimum n with the property that every coloring yields either with , or with all distinct. We prove that if , then as . This supports the conjecture of Lefmann, Rödl, and Thomas that .

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, University of Illinois; 1409 W. Green street, Urbana, IL 61801–2975 USA; E-mail: j-tao@math.uiuc.edu, , , , , , US

    Tao Jiang

  2. Department of Mathematics, University of Illinois; 1409 W. Green street, Urbana, IL 61801–2975 USA and School of Mathematics, Georgia Institute of Technology; Atlanta, GA 30332-0160, USA; E-mail: mubayi@math.gatech.edu, , , , , , US

    Dhruv Mubayi

Authors
  1. Tao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dhruv Mubayi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 2, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, T., Mubayi, D. NOTE New Upper Bounds for a Canonical Ramsey Problem. Combinatorica 20, 141–146 (2000). https://doi.org/10.1007/s004930070037

Download citation

  • Issue Date:

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

Search

Navigation