Talk:Equitability of matroids
Contents
Missing condition -- Dion 21:33, 23 January 2010 (UTC)
In this conjecture, the set B should probably be required to be both a base and the complement of a base. Indeed, otherwise the conjecture would (trivially) be true by taking a base-cobase and moving one exchange at a time to its complement.
Re: Missing condition -- Tamás Király 18:40, 24 January 2010 (UTC)
- Thanks, you are right. I corrected the conjecture.
True for hypergraphic matroids -- Tamás Király 10:37, 25 February 2011 (UTC)
It is very easy to see that hypergraphic matroids are equitable. Let H=(V,E) be a hypergraph whose edge set can be partitioned into two bases: B and E-B. Then for every hyperedge e∈E we can choose a graph edge e′⊆e such that B′ (the chosen graph edges for hyperedges in B) and (E−B)′ are forests with the same components. Thus the circuit matroid of the graph G=(V,E') can be partitioned into 2 bases. We know that this circuit matroid is equitable; but this clearly implies that the hypergraphic matroid is also equitable, since for any base in the circuit matroid, the corresponding hyperedges form a base in the hypergraphic matroid too.
Stronger corollary -- Tamás Király (talk) 13:44, 15 July 2015 (UTC)
If the conjecture is true, then the following, seemingly stronger statement is also true:
If the ground set S of a matroid M can be partitioned into k bases, then for any set X⊆S there is a partition B1,…,Bk into k bases such that ⌊|X|/k⌋≤|Bi∩X|≤⌈|X|/k⌉ for every i.
Indeed, consider a partition B1,…,Bk into k bases such that k∑i=1|(|Bi∩X|−|X|/k)| is minimal. We can assume that |B1∩X|≤⋯≤|Bk∩X|. If B1,…,Bk does not satisfy the conditions, then we can use the equitability w.r.t. X of the matroid M restricted to B1∪Bk, to obtain B′1 and B′k such that |B′k∩X|−|B′1∩X|<|Bk∩X|−|B1∩X|. This contradicts the choice of B1,…,Bk.