On the Caratheodory rank of polymatroid bases

2010/03/04 by Gijswijt, Dion, Regts, Guus · 1 citation
#52B40 #90C10 #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1003.1079

Abstract

In this paper we prove that the Carathéodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of the ground set.

Cited by

• Fair Multi-agent Persuasion with Submodular Constraints

Related

• Relative rank axioms for infinite matroids
• Matroids satisfying the matroidal Cayley--Bacharach property and ranks of covering flats
• A combinatorial version of the colorful Caratheodory theorem
• Cyclic flats of a polymatroid
• The cyclic flats of L-polymatroids