Free products, extremal matroids, and a generalization of perfect matroid designs
Combinatorics
2026-07-10 v1
Abstract
Extremal matroids are those that yield vertices in the polytope of matroids. We show how to get the point, in the appropriate polytope of matroids, for the free product of matroids and from the points for and in their polytopes of matroids. With this we show that if is extremal, then and are extremal. The converse is false. We identify a large class of matroids that includes perfect matroid designs and sparse paving matroids, and we find sufficient conditions under which free products of extremal matroids in this class are extremal.
Keywords
Cite
@article{arxiv.2607.09972,
title = {Free products, extremal matroids, and a generalization of perfect matroid designs},
author = {Joseph E. Bonin},
journal= {arXiv preprint arXiv:2607.09972},
year = {2026}
}
Comments
26 pages