Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.12100

Matroids are Equitable

Hannaneh Akrami·Siyue Liu·Roshan Raj·László A. Végh
View original source ↗Read source document ↗Export metadata ↓

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 Szabó (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. We also derive applications of this result into matroid constrained fair division problems. We show that there exists a matroid-constrained fair division that is envy-free up to one item if the valuations are identical and tri-valued additive. We also show that for bi-valued additive valuations, there exists a matroid-constrained allocation that provides everyone their maximin share.

Explore related subjects

math.COcs.DMcs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hannaneh Akrami, Siyue Liu, Roshan Raj, László A. Végh. 2025-12-01. Matroids are Equitable. https://arxiv.org/abs/2507.12100

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗