Problemcore
Minimum edge cover
Also called minimum cardinality edge cover.
Find an edge cover with the fewest edges; solvable from a maximum matching by Gallai's identity.
Find an edge cover with the fewest edges; solvable from a maximum matching by Gallai's identity.
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 3FNQQN Edit this page History Report an error