✳flâneur — a map of the web's best reading

A simpler proof of the KPR theorem | tcs math

tcsmath.wordpress.com · 2,048 words · saved by 1 readers

1. Introduction The Klein-Plotkin-Rao (KPR) Theorem is a powerful statement about the geometry of planar graphs and their generalizations. Here, I’ll present a new, very simple proof of the t…

1. Introduction The Klein-Plotkin-Rao (KPR) Theorem is a powerful statement about the geometry of planar graphs and their generalizations. Here, I’ll present a new, very simple proof of the theorem that was discovered in joint work with Cyrus Rashtchian . (This will appear in a preprint soon, together with some new results.) In the next post, I’ll give some applications in geometry and algorithms. Recall that a graph is planar if it can be drawn in the plane without any edge crossings. Wagner’s theorem gives an intrinsic characterization of planar graphs in terms of excluded

Explore this link on the map →

saved by

related reading