Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Put and color by modulo two. A unit equilateral triangle has vertical span at least : one of its three unoriented edge directions is within degrees of vertical. Its span is at most . Hence a monochromatic triangle cannot lie in one half-open strip and can meet at most two strips of its color. In the latter case the lone vertex in one strip has vertical displacement strictly greater than from each of the other two vertices, in the same direction. The two unit vectors to those vertices make angle degrees, so their sum has length . Its vertical component would exceed , a contradiction. The coloring avoids all unit equilateral triangles, including boundary cases.
Suppose the statement of L32 fails for some . There are then positive and planar sets of at most points whose hypergraphs of equilateral triples of lengths or are not two-colorable. Some component of each hypergraph is not two-colorable, since separate component colorings combine. Pass to these components and a subsequence with fixed number of labeled vertices and fixed abstract hyperedge set; there are only finitely many possibilities.
Translate one vertex to the origin. In a connected component, any vertex can be reached by a path of at most pairs belonging to hyperedges. Those pairs have length at most eventually. All coordinates are therefore bounded, and a subsequence converges coordinatewise. Every hyperedge limits to three distinct points forming a unit equilateral triangle. Vertices outside a common hyperedge may coalesce; this does not matter. Pull back the strip coloring of the limiting points to the labels. It properly colors every hyperedge of the fixed abstract hypergraph, contradicting its non-two-colorability.