Theoremadvanced
Wagner's theorem
Also called minor characterization of planarity.
A graph is planar if and only if it has no K5 or K3,3 minor.
A graph is planar if and only if it has no K5 or K3,3 minor.
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 YHBYC8 Edit this page History Report an error