Quadratic lower-bound conjecture for empty red-red-blue triangles
Statement
Let and be disjoint sets of red and blue points, respectively, in the plane. An empty red-red-blue triangle is a triangle whose vertices consist of two points of and one point of , and whose interior contains no point of . Quadratic lower-bound conjecture. There exist empty red-red-blue triangles in . The paper notes that no construction with subquadratically many such triangles is known; in particular, balanced bichromatic Horton sets contain of them. Thus the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.