Matroid minor
Builds on MatroidMatroid rankDual matroid
Definition
Let be a matroid with rank function , and let .
- The deletion is the matroid on whose independent sets are the sets with .
- The contraction is the matroid on with rank function for .
- A matroid is a minor of if for some disjoint sets .
Remarks
If is a maximal independent subset of , then a set is independent in if and only if . Deletion and contraction commute, and , where is the dual matroid. Many authors call a minor when it is isomorphic to a matroid of the form in clause 3. For the graphic matroid of a graph, deleting or contracting an edge gives the graphic matroid of the graph with that edge deleted or contracted.
Example: let , the matroid on whose independent sets are the subsets with at most elements. Then , and , since .
Non-example: is not a minor of , because deletion and contraction never raise the rank, and has rank while has rank .
A theorem of Tutte states that a matroid is representable over the field with two elements if and only if it has no minor isomorphic to .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Dual matroid concept
- Matroid concept
- Matroid rank concept
- Matroid minor definition
Further reading
About this page
| Tag | 7Z0QZP0FC0 |
|---|---|
| URI | m2://7Z0QZP0FC0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05B35 |
| Defines | Matroid minor |
| Uses | Matroid, Matroid rank, Dual matroid |
| 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.
What links here
No page links to this page yet.