Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A problem posed to me by a friend:

Show that any two-coloring of $\mathbb{R}^2$ that contains a monochromatic equilateral triangle of side-lengths 1 also contains monochromatic triangles of all side lengths $(1,a,b) \mid a+b>1$

share|cite|improve this question
Presumably $a+b > 1$, otherwise there are no such triangles. – Robert Israel May 15 '12 at 18:56
Some thoughts: Let the monochromatic equilateral triangle be $ABC$. There are lots of triangles you can make with side lengths $(1,a,b)$: you can use the sides $AB$, $AC$, or $BC$ as the length $1$ side and pick a corresponding point to get the other side lengths. With so many possibilities, perhaps you can show a monochromatic triangle can't be avoided. – Austin Mohr May 15 '12 at 18:57
This is posed as a difficult problem number 14.8 in Lovász László, Combinatorial Problems and Exercises, 2nd ed. You may check out the hints given there in the hints section. – Zsbán Ambrus May 15 '12 at 19:10
Thanks for the reference, @ZsbánAmbrus – Ternary May 15 '12 at 19:35

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.