← All problems

Oxley’s 1983 basis–circuit rank conjecture

For every nonempty simple binary matroid MM with no coloops, prove that 2b(M)≥(r(M)+1)d(M)2b(M)\geq (r(M)+1)d(M), where b(M)b(M) is the number of bases, d(M)d(M) is the number of circuits, and r(M)r(M) is the rank of MM. The claimed equality characterization is that equality holds if and only if MM is isomorphic to the Fano matroid.

References

Progress summary

Refreshed
Open · solution reported

A new manuscript claims to settle the conjecture, but its proof has not been independently checked.

Oxley’s 1983 conjecture concerns a sharp relation among bases, circuits, and rank in binary matroids. The new manuscript claims the inequality, its equality cases, and additional basis-growth inequalities.

Known results

  • Oxley (1983): for a simple binary matroid, the number of bases divided by the number of circuits is at least 22.
  • Oxley (1983): if there are no coloops and the rank is rr, that quotient exceeds 6(r+1)/196(r+1)/19.

October 8, 2026 preprint claim

On October 8, 2026, Houshan Fu’s manuscript A rank bound for bases and circuits in binary matroids claimed the conjectured inequality, an equality characterization, and further inequalities under deletion and series extension. This is an unrefereed claim without independent corroboration.

Current status (as of October 2026): The classical Oxley bounds are established, while Fu’s broader resolution remains an unverified claim.

Sources

Solutions 0

No solutions have been posted yet.