Base-orderable matroid
Summary
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.
Further reading
- Wikipedia, page 65674252, revision 1154271040, Base-orderable matroid. adopted
About this page
| Tag | J517QKT7CQ |
|---|---|
| URI | m2://J517QKT7CQ |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (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.