Problemadvanced
Crossing number
Also called graph crossing number.
Minimum number of edge crossings over all drawings of a graph; zero exactly when the graph is planar.
Minimum number of edge crossings over all drawings of a graph; zero exactly when the graph is planar.
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 3ZHRA5 Edit this page History Report an error