Conceptintro
Spanning forest
Also called maximal forest.
A spanning subgraph of a disconnected graph whose components are spanning trees.
A spanning subgraph of a disconnected graph whose components are spanning trees.
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 QAACP7 Edit this page History Report an error