Math 2.0

Theorem

Koebe–Andreev–Thurston circle packing theorem

Statement

If GG is a finite connected planar graph, then a circle packing in the plane whose tangency graph is isomorphic to GG exists. If GG has a fixed planar embedding, the circle packing can be chosen so that the cyclic order of tangencies around each circle corresponds to the order of edges around each vertex in the embedding. If GG is maximal planar, this packing is unique, up to reflections in lines and Möbius transformations.

Further reading

  1. Wikipedia, page 16648043, revision 1375504925, Circle packing theorem, section Theorem statement and proofs. adopted
About this page
TagNNZV4614R1
URIm2://NNZV4614R1
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status NNZV4614R1.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.