 Corners theorem

Corners theorem, often referred to in the context of graph theory and combinatorial geometry, generally deals with conditions on the arrangement of points or vertices in a specific geometric or combinatorial setting. The theorem states that given a finite set of points in the plane, one can find a subset of these points such that certain geometric or combinatorial properties hold, often involving the vertices (or corners) of a configuration.