combinatorics / Matroid theory

The Divisible Rank-Three Case of the Kajitani–Ueno–Miyano Conjecture

Proves the divisible rank-three case: rank exactly three and ground-set size a multiple of three, with no restriction to simple, paving, representable or graphic matroids. The part not previously in the literature is the non-simple sub-case, since McGuinness had settled all paving matroids and a rank-three matroid is paving exactly when it has no parallel pairs. Combined with the coprime-case theorem of van den Heuvel and Thomasse, this covers every finite uniformly dense rank-three matroid. The conjecture remains open in higher rank.

30Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsAug 5, 2026Significance 30/100Registry: lean verified

The Divisible Rank-Three Case of the Kajitani–Ueno–Miyano Conjecture

Prior state unknown→proved

Proves the divisible rank-three case: rank exactly three and ground-set size a multiple of three, with no restriction to simple, paving, representable or graphic matroids. The part not previously in the literature is the non-simple sub-case, since McGuinness had settled all paving matroids and a rank-three matroid is paving exactly when it has no parallel pairs. Combined with the coprime-case theorem of van den Heuv…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Proves the divisible rank-three case: rank exactly three and ground-set size a multiple of three, with no restriction to simple, paving, representable or graphic matroids. The part not previously in the literature is the non-simple sub-case, since McGuinness had settled all paving matroids and a rank-three matroid is paving exactly when it has no parallel pairs. Combined with the coprime-case theorem of van den Heuvel and Thomasse, this covers every finite uniformly dense rank-three matroid. The conjecture remains open in higher rank.

Proves the divisible rank-three case: rank exactly three and ground-set size a multiple of three, with no restriction to simple, paving, representable or graphic matroids. The part not previously in the literature is the non-simple sub-case, since McGuinness had settled all paving matroids and a rank-three matroid is paving exactly when it has no parallel pairs. Combined with the coprime-case theorem of van den Heuvel and Thomasse, this covers every finite uniformly dense rank-three matroid. The conjecture remains open in higher rank.

Recorded attempts

Evidence graph

Connected research record