13 problems
Let be a matroid, and let and be unordered pairs of bases such that the multiset union of and is equal to the multiset union…
Let and be bases of a matroid with rank function . For any and and integer with ,…
Let be a matroid of rank , and let and be compatible basis pairs, meaning that … A symmetric exchange is an exchange of elements between the two bases that…
Let be a matroid and let … be two bases. Gabow's conjecture. There exist permutations and such that in the sequence … every set of cyclically c…
A matroid is subsequence-interchangeably base orderable (SIBO) if every pair of bases admits the subsequence exchange orderings specified in the paper. Sparse-paving SIBO conjectur…
A rank- matroid is subsequence-interchangeably base orderable (SIBO) if every pair of bases and admits orderings of and of such…
Let be a matroid of rank , and let and be disjoint bases. The exchange distance of two basis sequences is the minimum number of symmetric exchanges needed to tra…
Weighted exchange-distance conjecture. The weighted exchange distance of and is at most
White's conjecture. The sequences and are equivalent if and only if they are compatible. Compatibility is evidently necessary, and the conjecture is con…
Gabow's conjecture. There are orderings and such that
Common-basis conjecture. There exist partitions of and into pairwise disjoint bases that share a common basis.
Cyclic ordering conjecture. It is possible to place the elements of the ground set of on a circle so that every consecutive elements form a basis of .
Farber's conjecture. The basis pair graph of any matroid is connected.