Colored matroid
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a colored matroid is a matroid whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first n positive integers, or the sign set {+, −}. The interest in colored matroids is through their invariants, especially the colored Tutte polynomial, which generalizes the Tutte polynomial of a signed graph of . There has also been study of optimization problems on matroids where the objective function of the optimization depends on the set of colors chosen as part of a matroid basis.
In mathematics, a colored matroid is a matroid whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first n positive integers, or the sign set {+, −}. The interest in colored matroids is through their invariants, especially the colored Tutte polynomial, which generalizes the Tutte polynomial of a signed graph of . There has also been study of optimization problems on matroids where the objective function of the optimization depends on the set of colors chosen as part of a matroid basis.
See also
Bipartite matroid Rota's basis conjecture
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1190779321 under CC BY-SA 4.0; modifications have been made.