Gabow's cyclic basis conjecture

Let M\mathcal{M} be a matroid and let

B1={b1,,br},B2={b1,,br}B_1=\{b_1,\ldots,b_r\},\qquad B_2=\{b'_1,\ldots,b'_r\}

be two bases. Gabow's conjecture. There exist permutations σ\sigma and σ\sigma' such that in the sequence

(bσ(1),,bσ(r),bσ(1),,bσ(r)),(b_{\sigma(1)},\ldots,b_{\sigma(r)},b'_{\sigma'(1)},\ldots,b'_{\sigma'(r)}),

every set of rr cyclically consecutive elements forms a basis. The conjecture strengthens the two-base case of White's basis sequence exchange problem by requiring a cyclic ordering with all consecutive rr-element windows independent as bases.

Sources & referencesView supporting material

Primary source

Hannaneh Akrami, Siyue Liu, Roshan Raj and László A. Végh, “Matroids are Equitable”, arXiv:2507.12100 (2025).

Additional references

6 papers in this index state this conjecture (2010–2025). The statement above is taken from the most recent of them; the others are arXiv:2411.01061, arXiv:2302.01445, arXiv:1601.03526, arXiv:1110.1826, arXiv:1011.1010.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.