Skip to main content
1 of 2

Determining strong base-orderability of a matroid

A matroid is said to be strongly base-orderable when for any two bases $B_1,B_2$ there exists a bijection $f:B_1 \mapsto B_2$ such that for any $X\subseteq B_1$ set $B_1 - X+ f(X)$ is also a base. Suppose we are given a matroid, but we don't know if it is SBO. How in polynomial time can we check the SBO condition?