Tag Archives: Erdos-Sos Conjecture

Micha Perles’ Geometric Proof of the Erdos-Sos Conjecture for Caterpillars

A geometric graph is a set of points in the plane (vertices) and a set of line segments between certain pairs of points (edges). A geometric graph is simple if the intersection of  two edges is empty or a vertex … Continue reading

Posted in Combinatorics, Geometry | Tagged , | 1 Comment