Sylvester-Gallai Theorem:
n points in the 2D plane, not all collinear. There is a line which passes through exactly two points.
Proof: Dualize. Points<->Lines. In dual, we need to show no more than 3 lines intersect. Consider intersection points and lines as planar graph. Planar graphs have nodes with degree no more than 5. Done.
