Theoremadvanced
Matroid intersection theorem
Also called Edmonds' min-max theorem for matroid intersection.
The maximum common independent set size equals the minimum of a rank-based expression over subsets.
The maximum common independent set size equals the minimum of a rank-based expression over subsets.
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 YXPP84 Edit this page History Report an error