A delta-matroid is a mathematical structure that generalizes the concept of a matroid. Delta-matroids were introduced by Bouchet in the context of combinatorial optimization and have applications in graph theory, vector spaces, and related areas. A delta-matroid is defined on a finite set \(E\) and is characterized by a collection of subsets of \(E\), known as the "feasible sets," which satisfy certain properties.
Articles by others on the same topic
There are currently no matching articles.