Gabow's exchange-distance conjecture for disjoint matroid bases

Let MM be a matroid of rank rr, and let X1X_1 and X2X_2 be disjoint bases. The exchange distance of two basis sequences is the minimum number of symmetric exchanges needed to transform one sequence into the other. Gabow's conjecture. The exchange distance of (X1,X2)(X_1,X_2) and (X2,X1)(X_2,X_1) is rr. This problem was formulated by Gabow and later stated as a conjecture by Wiedemann and by Cordovil and Moreira. It is known for several classes of matroids, but remains open in general.

Sources & referencesView supporting material

Primary source

Kristóf Bérczi, Bence Mátravölgyi and Tamás Schwarcz, “Reconfiguration of basis pairs in regular matroids”, arXiv:2311.07130 (2023).

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.