Tightness problems in the plane (Q1297464)

The authors study the chromatic behaviour of classes of triangles (viewed as triples of points, so a class of geometrically defined 3-uniform hypergraphs) under 3-colorings of the points of the plane. They call a set \(T\) of triangles tight if for any 3-coloring of the plane which really uses all three colors there is a triangle in \(T\) whose vertices received all three colors; and almost tight, if for any such 3-coloring there is a triangle such that in any neighbourhood of the vertices all three colors occur. They characterize almost-tightness: \(T\) is almost tight if and only if any two points of the plane can be extended by a third point to give a triangle in \(T\). Also they obtain some sufficient criteria for \(T\) for tightness or untightness, e.g. if there is a set of points \(S\) such that for all \(a,b\in S\) each possible extension \(c\) with \(\{ a,b,c\}\in T\) belongs again to \(S\), and \(S\) is not the whole plane, then \(T\) is not tight. And they show for some specific classes of triangles that they are tight, e.g. for the class of all triangles containing an angle \(\alpha\) for each fixed \(\alpha\).