← All problems

Common-basis conjecture for partitions of a matroid ground set

10 years old · traced to

Let k≥2k\geq 2, and let MM be a matroid of rank rr on a ground set EE with ∣E∣=kr+1|E|=kr+1. Suppose x,y∈Ex,y\in E are such that both E∖{x}E\setminus\{x\} and E∖{y}E\setminus\{y\} can be partitioned into kk pairwise disjoint bases.

Common-basis conjecture. There exist partitions of E∖{x}E\setminus\{x\} and E∖{y}E\setminus\{y\} into kk pairwise disjoint bases that share a common basis.

This is the second conjecture introduced as closely related to White's conjectures. It expresses a common-basis condition for two complementary decompositions and is not resolved in the supplied text.

References
  1. Michał Lasoń, “On the toric ideals of matroids of a fixed rank”, arXiv:1601.08199 (2021).

Progress summary

Refreshed
Open · progress reported

A reader-submitted construction claims to disprove the conjecture, but no independent verification was found.

The conjecture asks whether two decompositions of nearly identical matroid ground sets can be chosen to share a basis; the catalogued literature reported no resolution as of January 2016.

Community submission (unverified), November 7, 2026

A submitted argument claims an explicit rank-44 binary matroid on 99 elements, with k=2k=2, whose two relevant deletions each split into two bases but for which no such partitions share a basis. If correct, this is a counterexample in the stated generality; the submission does not claim a simple-matroid counterexample or any consequence for White’s conjecture.

Current status (as of November 2026): The conjecture remains unverified; a community submission claims it is false via a rank-44 counterexample, but no independent confirmation was found.

Sources

Solutions 1

A rank-four binary matroid on nine elements has two-base partitions after deleting either x = 1 or y = 6, but no such pair of partitions shares a base. This refutes the common-basis conjecture in its printed scope, which permits parallel elements.See full solutionHide full solution

The paper gives an explicit rank-four binary matroid on E = {0,...,8}, with x = 1 and y = 6. Each deletion admits a partition into two bases, yet no pair of such partitions shares a base. The construction uses parallel elements, which the printed conjecture permits. It refutes the conjecture in that full scope; no simple-matroid counterexample, minimality, infinite family, or refutation of White's conjecture is claimed.

Result and scope: An actual rank4 matroid on9 labeled elements, with k2 and x1,y6, has two-base partitions of both deletions but no choices of such partitions share a base. Parallel elements permitted by source; full literal conjecture negation.

Complete proof and verification sources: A rank-four nine-element counterexample to Lason common-basis conjecture · PDF.

The paper page includes the supplementary proof-source JSON attachment and extract_sources.py, which reconstruct the archived proof and verification sources. The linked paper gives the complete rigorous argument and specifies exactly which statements are formalized.

This is an AI-assisted research preprint. Internal review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for the source, interpretation, formalization, and trust limitations.