Matroids are Equitable

View at publisher
Authors: Hannaneh Akrami, Roshan Raj, László A. Végh
Cited by: 0

Abstract

We show that if the ground set of a matroid can be partitioned into \(k \ge 2\) bases, then for any given subset \(S\) of the ground set, there is a partition into k bases such that the sizes of the intersections of the bases with \(S\) may differ by at most one. This settles the matroid equitability conjecture by Fekete and Szabo (Electron. J. Comb. 2011) in the affirmative. We also investigate equitable splittings of two disjoint sets \(S_1\) and \(S_2\), and show that there is a partition into \(k\) bases such that the sizes of the intersections with \(S_1\) may differ by at most one and the sizes of the intersections with \(S_2\) may differ by at most two; this is the best one can hope for arbitrary matroids.

Fields of Study & Subjects

Computational Geometry and Mesh Generation Advanced Graph Theory Research Complexity and Algorithms in Graphs

Publication details

Journal / source
Society for Industrial and Applied Mathematics eBooks
Pages
5843–5860
Publication date
1 January 2026
Language
EN