--- title: Matroid Equitability Conjecture Resolution url: https://www.emergentmind.com/topics/matroid-equitability-conjecture type: topic --- # Matroid Equitability Conjecture Resolution The Matroid Equitability Conjecture concerns the extent to which a partition of a matroid ground set into bases can be made balanced with respect to a prescribed subset. In its original form, posed by Fekete and Szabó in 2011, it asked whether every matroid whose ground set can be partitioned into two bases admits, for every subset $S \subseteq E$, a decomposition $E=B_1 \sqcup B_2$ into two bases such that $||B_1\cap S|-|B_2\cap S||\le 1$. Akrami, Raj, and Végh proved a substantially stronger statement: if the ground set can be partitioned into $k \ge 1$ disjoint bases, then for every $S\subseteq E$ there is a partition into $k$ bases whose intersections with $S$ all have sizes between $\lfloor |S|/k\rfloor$ and $\lceil |S|/k\rceil$, and such a partition can be found in polynomial time [2507.12100]. The same work also establishes near-equitable splittings for two disjoint sets and derives applications to matroid-constrained fair division [2507.12100]. ## 1. Statement of the conjecture and its resolution Let $M=(E,\mathcal I)$ be a matroid of rank $r$. In the formulation highlighted by Fekete and Szabó, one assumes that the ground set $E$ can be partitioned into two bases. The matroid is called equitable if, for every subset $S\subseteq E$, there exists a partition $E=B_1\sqcup B_2$ into two bases satisfying $$ \bigl||B_1\cap S|-|B_2\cap S|\bigr|\le 1. $$ The question “Is every matroid equitable?” was left open in Electron. J. Comb. 2011 and became known as the matroid equitability conjecture. The theorem proved in "Matroids are Equitable" [2507.12100] subsumes this original two-base problem. If $E$ can be partitioned into $k\ge 1$ disjoint bases, then for every $S\subseteq E$ there exists a partition $$ E=B_1\sqcup B_2\sqcup \cdots \sqcup B_k $$ into $k$ bases such that for all $i,j\in [k]$, $$ \lfloor |S|/k\rfloor \le |B_i\cap S|\le \lceil |S|/k\rceil, $$ equivalently, $$ \bigl||B_i\cap S|-|B_j\cap S|\bigr|\le 1. $$ This settles the conjecture in the affirmative and, in the one-set setting, achieves the strongest balancing compatible with integrality [2507.12100]. The result is algorithmic as well as existential: the equitable partition can be found in polynomial time. This algorithmic aspect is integral to the theorem rather than a secondary consequence. ## 2. Historical and conceptual context The equitability problem sits at the interface of basis exchange theory, fair representation, and combinatorial balancing. In a single matroid, fair representation phenomena are classical. Aharoni, Berger, Kotlar, and Ziv formulate this in terms of a simplicial complex parameter $\beta(\mathcal C)$, the minimum size of an edge-cover, and recall that when $\mathcal C$ is a matroid, Edmonds’ theorem gives $\beta(\mathcal C)=\rho(\mathcal C)$ [1612.07652]. They then state the folklore/Edmonds fair-representation theorem: if $P$ is a matroid and $\beta(P)=k$, then for every partition $V=A_1\sqcup\cdots\sqcup A_m$ there exists an independent set $S\in P$ with $$ |S\cap A_i|\ge \lceil |A_i|/k\rceil $$ for each $i$ [1612.07652]. The matroid equitability problem differs in a decisive way. Rather than selecting a single independent set that represents each part fairly, it seeks a partition of the entire ground set into bases with all basis-intersections with a prescribed subset as equal as possible. This makes the problem inherently reconfiguration-based: one is not merely proving existence of a favorable basis, but existence of a globally balanced basis decomposition. The work on fair representation in the intersection of two matroids provides a further contextual link. For a dimatroid $D=P\cap Q$, Aharoni–Berger–Kotlar–Ziv conjecture almost-fair representation bounds and prove the two-part case using truncation, fractional covering, and exchange-sequences in the dimatroid [1612.07652]. The later theorem that matroids are equitable is described as settling several special-case fair-representation conjectures for the matroid/dual-matroid pair [2507.12100]. This suggests that equitability, though weaker than the full two-matroid representation problem, captures a structurally central case. The same later paper also records conceptual links to classical exchange conjectures: White’s and Gabow’s basis-sequence conjectures would imply equitability as a corollary, while equitability is strictly weaker [2507.12100]. Accordingly, the conjecture belongs to the broader program of understanding how far basis exchange can be pushed toward canonical balancing statements. ## 3. Exchange structures underlying the proof The proof of equitability is organized around a refined exchange theory for pairs of disjoint bases [2507.12100]. Let $B_1,B_2$ be disjoint bases. A set $X\subseteq B_1\cup B_2$ is called exchangeable if both $B_1\Delta X$ and $B_2\Delta X$ are bases. Given a subset $S\subseteq E$ and an element $t$, one says that $X$ is $(t,S)$-exchangeable if $$ t\in X\subseteq S\cup \{t\}. $$ This notion packages precisely the exchanges needed to move one unit of $S$-mass from one basis to another while preserving the basis property. The corresponding combinatorial object is the directed bipartite exchange graph $D(B_1,B_2)$ on $B_1\sqcup B_2$. Its edges are $$ x\to y \quad \text{if } B_i-x+y\in \mathcal B \text{ and } x\in B_i,\ y\in B_j,\ i\neq j. $$ Here $\mathcal B$ denotes the family of bases. The graph encodes admissible one-element transfers between the two bases. Several standard and nonstandard exchange principles are then deployed. The symmetric exchange lemma states that for each $x\in B_1$ there exists $y\in B_2$ with mutual exchange. More generally, Schrijver’s matching-exchange statement implies that any perfect matching in the induced bipartite graph $D(B_1,B_2)[B_1\Delta B_2]$ corresponds to an exchangeable set [2507.12100]. Directed cycles in the exchange graph are especially useful: any directed cycle $C$ yields an exchangeable set $X=V(C)$, and a chordless cycle gives a unique perfect matching in each bipartite half, so by the matroid-matching theorem $X=V(C)$ is exchangeable [2507.12100]. When immediate exchanges are unavailable, the argument turns to a more delicate circuit analysis. If one cannot directly find a short cycle or symmetric exchange between $B_1\setminus S$ and $B_2\cap S$, one studies a strongly connected component $K$ of $D(B_1,B_2)[S]$ with $|K\cap B_1|<|K\cap B_2|$. One then constructs a family $\{C_x\}_{x\in K\cap B_2}$ of fundamental-type circuits satisfying specified witness properties, and applies strong circuit-exchange to combine them into a single circuit with a contradictory exchange behavior, thereby forcing the desired cycle [2507.12100]. This circuit-family argument is the technical core of the proof. ## 4. The exchange theorem and the polynomial-time balancing algorithm The global balancing theorem is obtained by iterating a two-base exchange statement. The crucial result is Theorem 2.2 of "Matroids are Equitable" [2507.12100]: > Let $B_1,B_2$ be disjoint bases with $|B_1\cap S|<|B_2\cap S|$. Then there exists $t\in B_1\setminus S$ and an associated $(t,S)$-exchangeable set $X\subseteq B_1\cup B_2$, computable in polynomial time. Its proof proceeds through the exchange graph. If there is a direct symmetric edge from some $t\in B_1\setminus S$ to some $y\in B_2\cap S$, then $X=\{t,y\}$ already works. Otherwise, the strongly connected component and circuit-family machinery is used to produce a directed cycle $C$ with exactly one vertex $t\in B_1\setminus S$; taking a minimal such cycle yields a chordless cycle and hence an exchangeable set $X=V(C)$ [2507.12100]. From this theorem, the balancing algorithm is straightforward in outline. Start from any partition of $E$ into $k$ bases. If there are indices $i,j$ with $$ |B_i\cap S|\le |B_j\cap S|-2, $$ focus on the pair $(B_i,B_j)$. The exchange theorem provides a $(t,S)$-exchangeable set $X$ that swaps one element $t$ from $B_i\setminus S$ with some element of $B_j\cap S$. Replacing $(B_i,B_j)$ by $(B_i\Delta X,B_j\Delta X)$ increases $|B_i\cap S|$ by $1$ without affecting the other bases [2507.12100]. Each step decreases the range $$ \max_i |B_i\cap S|-\min_i |B_i\cap S| $$ by at least $1$. Consequently, within $O(|S|)$ steps one reaches a configuration in which all intersection sizes differ by at most one [2507.12100]. Since each step is polynomial-time computable, the entire procedure is polynomial-time. The theorem is therefore both structural and constructive. ## 5. Two-set near-equitability The paper extends the one-set theorem to the simultaneous balancing of two disjoint subsets $S_1,S_2\subseteq E$ [2507.12100]. Exact $\pm 1$ balancing in both coordinates cannot be guaranteed for arbitrary matroids: the $K_4$ graphic matroid gives an example in which an unavoidable $\pm 2$ discrepancy appears in one of the two sets [2507.12100]. The obstruction is therefore genuine rather than an artifact of the proof. Under the same hypothesis that $E$ can be partitioned into $k$ bases, Theorem 3.1 shows that there exists a $k$-base partition such that: 1. for all $i,j$, $$ \bigl||B_i\cap S_1|-|B_j\cap S_1|\bigr|\le 1; $$ 2. for all $i,j$, $$ \bigl||S_1\cap B_i|-|S_1\cap B_j|\bigr|+\bigl||S_2\cap B_i|-|S_2\cap B_j|\bigr|\le 2; $$ 3. a similar bound holds for $S_1\cup S_2$. For $k=2$, Corollary 3.2 yields a parity-sensitive trichotomy [2507.12100]. The possibilities are summarized below. | Parity of $(|S_1|,|S_2|)$ | Conclusion for two bases | |---|---| | both odd | exact partition of each | | one odd, one even | exact on the odd, difference $\pm 1$ on the even | | both even | one set splits exactly, the other has difference at most $2$ | The paper describes this as tight. In particular, the appearance of the bound $2$ in the two-set setting is not merely technical. A plausible implication is that the transition from one monitored subset to two monitored subsets changes the balancing problem qualitatively: the one-set case is governed by exact floor/ceiling balancing, while the two-set case is constrained by unavoidable interaction effects between the two coordinates. ## 6. Applications to matroid-constrained fair division The same exchange and balancing results yield two applications in fair division under a common matroid constraint on the item set $E$, where every allocated bundle must be a basis and valuations are additive [2507.12100]. The first concerns identical tri-valued valuations. If all agents share the same additive valuation $v$ taking exactly three values $\{c,a,b\}$ with $0\le c