Theoremadvanced
Ore's theorem
If deg(u) + deg(v) ≥ n for every non-adjacent pair u, v, the graph has a Hamiltonian cycle.
If deg(u) + deg(v) ≥ n for every non-adjacent pair u, v, the graph has a Hamiltonian cycle.
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 G10SM7 Edit this page History Report an error