Combinatorics Algebraic combinatorics Concept
Matroid minor
Summary
A minor of a matroid is a matroid obtained from it by deleting some elements and contracting others. Deletion and contraction generalize the deletion and contraction of edges of a graph, and they are exchanged by matroid duality. Many classes of matroids are closed under minors and are characterized by a list of excluded minors. This parallels the role of graph minors for classes of graphs.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 4WCYBSH1P6 |
|---|---|
| URI | m2://4WCYBSH1P6 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05B35 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.