MathDBThe conjecture that every sparse paving matroid is SIBO
The conjecture that every sparse paving matroid is SIBO
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 conjecture. Every sparse paving matroid is SIBO. This is posed as a new conjecture after the paper proves the multi-labeled proximity statement for sparse paving matroids; its status is open.
Sources & referencesView supporting material
Primary source
Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz and Yutaro Yamaguchi, “Towards the Proximity Conjecture on Group-Labeled Matroids”, arXiv:2411.06771 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.