3 articles
Borsuk's conjecture
Borsuk's conjecture, also known as the Borsuk problem, is a 1933 claim by Karol Borsuk that every bounded set in d-dimensional space splits into d + 1 smaller-diameter parts.
Discrete geometry
Discrete geometry, also called combinatorial geometry, is the branch of geometry studying discrete arrangements of points, lines, polygons, and polyhedra, with applications in robotics, computer graphics, and crystallography.
Happy ending problem
The happy ending problem, also called the Erdős–Szekeres conjecture, asks how many points in general position in the plane guarantee n vertices of a convex polygon, named for the marriage of George Szekeres and Esther Klein.