Definitionintro
Simple graph
Also called loopless simple graph.
Graph with no self-loops and no parallel edges.
Graph with no self-loops and no parallel edges.
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 DWMSS8 Edit this page History Report an error