Erd?s problems and related topics of discrete geometry [See also 11Hxx]
8 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Subsets of the grid with no isosceles triangles (AlphaEvolve problem 59). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.
Erdős--Szekeres Happy Ending problem (AlphaEvolve problem 58). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.
Good asymptotic constructions of Szemerédi--Trotter (AlphaEvolve problem 56). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.
Equidistant points in convex polygons (AlphaEvolve problem 53). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.
Max to min ratios (AlphaEvolve problem 50). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.
Erdős unit distance exponent: determine C 84a or improve its bounds; the repository records 1.014 (1.03583 ) (lower) and frac 4 3 approx 1.3333 (upper).
Chromatic number of the plane: determine C 27a or improve its bounds; the repository records 5 (lower) and 7 (upper).
The No-Three-in-Line Problem. Moderately interesting problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Springer Nature
Discrete geometry and geometric computation
2015 · 1 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 138