Skip to main content
SpringerLink
Log in

Large independent sets in shift-invariant graphs

Solution of Bergelson's problem

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We construct shift-invariant graphs with chromatic number ∞ and independent sets of density close to 1/2.

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.

Similar content being viewed by others

References

  1. Bergelson, V.: Open problem. Joint summer conference of AMS on Ramsey theory, Arcata, 1985

  2. Kronecker, L.: Werke, Band 3. Halbband 1, Leipzig 1899

  3. Lovász, L.: Kneser's conjecture, chromatic number and homotopy. J. Comb. Theory (A)25, 319–324 (1978)

    Google Scholar 

  4. Szemerédi, E.: On sets of integers containing nok elements in arithmetic progression. Acta Arith.27, 199–245 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pujmanové 877, 14000, Praha 4, Czechoslovakia

    Igor Kříž

Authors
  1. Igor Kříž
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kříž, I. Large independent sets in shift-invariant graphs. Graphs and Combinatorics 3, 145–158 (1987). https://doi.org/10.1007/BF01788538

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation