In mathematics, a base-orderable matroid is a matroid that has the following additional property, related to the bases of the matroid. For any two bases and there exists a feasible exchange bijection, defined as a bijection from to , such that for every , both and are bases. The property was introduced by Brualdi and Scrimger. A strongly-base-orderable matroid has the following stronger property: For any two bases and , there is a strong feasible exchange bijection, defined as a bijection from to , such that for every , both and are bases.
Property | Value |
---|---|
dbo:abstract |
|
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink | |
dbp:wikiPageUsesTemplate | |
dcterms:subject | |
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:isPrimaryTopicOf | |
is dbo:wikiPageWikiLink of | |
is foaf:primaryTopic of |