Theoremcore
White-path theorem
A vertex is a DFS descendant of another exactly when it is reachable through white vertices at discovery time.
A vertex is a DFS descendant of another exactly when it is reachable through white vertices at discovery time.
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 7FA87V Edit this page History Report an error