Theoremcore
Greedy optimality on matroids
Also called matroid greedy theorem, greedy works exactly on matroids.
The greedy algorithm returns a maximum-weight basis for every weighted matroid, and the matroid property characterizes this.
The greedy algorithm returns a maximum-weight basis for every weighted matroid, and the matroid property characterizes this.
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 7DMG83 Edit this page History Report an error