1 research outputs found
Regular matroids have polynomial extension complexity
We prove that the extension complexity of the independence polytope of every
regular matroid on elements is . Past results of Wong and Martin on
extended formulations of the spanning tree polytope of a graph imply a
bound for the special case of (co)graphic matroids. However, the case of a
general regular matroid was open, despite recent attempts. We also consider the
extension complexity of circuit dominants of regular matroids, for which we
give a bound.Comment: Added results on the cut dominant of regular matroid