Kajitani–Miyano–Ueno conjecture on cyclically orderable matroids
Let be a matroid with ground set and rank function . A matroid is cyclically orderable if it has a cyclic permutation of its elements such that any consecutive elements form a basis. For every nonempty subset , define
when , and define otherwise. Let
Kajitani–Miyano–Ueno conjecture. The matroid is cyclically orderable if and only if
Equivalently, this asserts that cyclic orderability is characterized by for every nonempty , with the stated convention when . The paper verifies the conjecture for all paving matroids, but the general case is not resolved here.
References
Primary source
Sean McGuinness, “Cyclic Orderings of Paving Matroids”, arXiv:2308.12239 (2024).
Progress summary
The conjecture remains open in general, with proofs only for several important subclasses such as paving matroids.
The Kajitani–Miyano–Ueno conjecture says that the density condition exactly characterizes cyclic orderability. No source gives a date for its original formulation; the general assertion remains unresolved.
Known results
- Van den Heuvel and Thomassé proved the conjecture when (2009).
- Sparse paving matroids satisfy the conjecture; the retrieved sources record this as an earlier result.
- McGuinness proved the conjecture for all paving matroids (2023).
2024 split-matroid result
A 2024 paper proves cyclic orderability for a special class of split matroids whose ground set decomposes into pairwise disjoint bases. It neither proves nor disproves the general conjecture.
Current status (as of September 2026): The conjecture is proved for several subclasses, including paving matroids and the coprime case, but remains open for arbitrary matroids.
Solutions 0
No solutions have been posted yet.