Triangles of area one in sets of large measure
Show that every planar set of large enough measure contains the vertices of a triangle of area 1; Erdős guessed area 4π/√27 suffices.
Triangles of area one in sets of large measure
If a planar set has enough area, must three of its points span a triangle of area exactly ? Erdős showed this for sets of infinite measure, and guessed that area already suffices, the area of the largest disc that contains no such triangle. Even the existence of some finite threshold is open.
Problem
Is there a constant such that every Lebesgue measurable set of measure at least contains three points that are the vertices of a triangle of area ?
Erdős suggested that might work, which would be best possible: an open disc of radius less than has area close to , and every triangle inscribed in it has area less than .
Background
Erdős raised the question in the late 1970s in papers on measure-theoretic problems about point sets. He observed that the statement follows from the Lebesgue density theorem when has infinite measure, or is unbounded with positive measure, so the content of the problem lies in bounded sets of finite measure.
What is known
- Convex sets. By a theorem of Sas, any convex set of area greater than contains a triangle of area . Freiling and Mauldin showed that a set of outer measure greater than contains the vertices of a triangle of area greater than , which settles the problem with the conjectured threshold for compact convex sets.
- Unions of convex sets. Mauldin (2013) noted that it suffices to treat finite unions of interiors of compact convex sets, and Freiling and Mauldin proved the conjecture for unions of at most three such sets.
- Sets in a large square. Bulj and Kovač (2026, preprint) showed that a measurable set in with no triangle of area has measure for every , improving an earlier bound of Graham; the conjecture predicts .
What would count as progress
- A proof that some finite works, or any bound for sets in without unit-area triangles.
- The conjecture for unions of four or more convex sets, or for other natural classes such as finite unions of discs of equal radius.
- A set of measure greater than with no triangle of area , which would refute Erdős's guess for the constant; for explicit sets this can be checked numerically with rigorous bounds.
- A formal proof against the Lean statement in formal-conjectures.
References
- P. Erdős, Set-theoretic, measure-theoretic, combinatorial, and number-theoretic problems concerning point sets in Euclidean space, Real Anal. Exchange 4 (1978/79), 113–138. doi:10.2307/44151159
- R. D. Mauldin, Some problems and ideas of Erdős in analysis and geometry, in Erdős Centennial, Bolyai Soc. Math. Stud. 25 (2013), 365–376. doi:10.1007/978-3-642-39286-3_13
- A. Bulj and V. Kovač, On hyperbolic corners and unit-area triangles in planar sets of large measure (2026). arXiv:2605.30033
Source
Imported from Erdős Problems 352, curated by Thomas Bloom. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.