Skip to main content

Monochromatic Equilateral Right Triangles on the Integer Grid

  • Conference paper
Book cover Topics in Discrete Mathematics

Part of the book series: Algorithms and Combinatorics ((AC,volume 26))

Abstract

For any coloring of the N × N grid using fewer than log log N colors, one can always find a monochromatic equilateral right triangle, a triangle with vertex coordinates (x, y), (x + d, y), and (x,y + d).

Research supported in part by Grant CCR-0310991.

Research supported by NSERC and OTKA grants.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai and E. Szemerédi, Sets of lattice points that form no squares, Stud. Sci. Math. Hungar. 9 (1974), 9–11.

    MathSciNet  Google Scholar 

  2. J. Bourgain, On triples in arithmetic progression. Geom. Func. Anal. 9 (1999), 968–984.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Erdős and R. L. Graham, ‘Old and new problems and results in combinatorial number theory’, Monographies de L’Enseignement Mathématique, vol 28, Université de Genève L’Enseignement Mathématique, (1980).

    Google Scholar 

  4. P. Erdős and P. Turán, On some sequences of integers, J. London Math. Soc. 11 (1936), 261–264.

    Article  Google Scholar 

  5. P. Prankl, R. L. Graham and V. Rödl, Quantitative theorems for regular systems of equations, Jour. Comb. Th. A 47 (1988), 246–261.

    Article  Google Scholar 

  6. H. Fürstenberg, and Y. Katznelson, An ergodic Szemerédi Theorem for commuting transformations, J. Analyse Math. 34 (1979), 275–291.

    Article  Google Scholar 

  7. K.F. Roth, On certain sets of integers, J. London Math. Soc. 28 (1953), 104–109.

    Article  MATH  MathSciNet  Google Scholar 

  8. I. D. Shkredov, On one problem of Gowers, Math. Arxiv math. NT/0405406.

    Google Scholar 

  9. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Ada Arith. 27 (1975), 199–245.

    MATH  Google Scholar 

  10. B. L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wiskunde 15 (1927), 212–216.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Graham, R., Solymosi, J. (2006). Monochromatic Equilateral Right Triangles on the Integer Grid. In: Klazar, M., Kratochvíl, J., Loebl, M., Matoušek, J., Valtr, P., Thomas, R. (eds) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33700-8_7

Download citation

Publish with us

Policies and ethics