Theoremintro
Euler's theorem on Eulerian graphs
Also called Euler's characterization of Eulerian circuits.
A connected graph has an Eulerian circuit iff every vertex has even degree; it has an Eulerian path iff at most two vertices have odd degree.
A connected graph has an Eulerian circuit iff every vertex has even degree; it has an Eulerian path iff at most two vertices have odd degree.
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 V7TB1S Edit this page History Report an error