Theoremcore
Planar separator theorem
Also called Lipton-Tarjan separator theorem.
Every planar graph on n vertices has a set of O(sqrt n) vertices whose removal splits it into pieces of at most 2n/3 vertices.
Every planar graph on n vertices has a set of O(sqrt n) vertices whose removal splits it into pieces of at most 2n/3 vertices.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag RH0N4B Edit this page History Report an error