In matroid theory, a *matroid minor* is a concept that extends the notion of graph minors to matroids. Matroids are combinatorial structures that generalize the concept of linear independence in vector spaces. Specifically, a matroid \( M \) can have a minor obtained in the following way: 1. **Deletion**: You can delete an element from the matroid. This corresponds to removing an edge from a graph.

Articles by others on the same topic (0)

There are currently no matching articles.