The Erdős–Ulam problem is a question in the field of combinatorial geometry, named after mathematicians Paul Erdős and George Ulam. The problem relates to the arrangement of points in Euclidean space and how subsets of those points can be grouped to form convex sets.
New to topics? Read the docs here!