Log In Sign Up

Regular matroids have polynomial extension complexity

by   Manuel Aprile, et al.

We prove that the extension complexity of the independence polytope of every regular matroid on n elements is O(n^6). Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a O(n^2) bound for the special case of (co)graphic matroids. However, the case of a general regular matroid was open, despite recent attempts.


page 1

page 2

page 3

page 4

βˆ™ 06/22/2021

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

Let G be a connected n-vertex graph in a proper minor-closed class 𝒒. We...
βˆ™ 12/09/2020

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1

A P_β„“-decomposition of a graph G is a set of paths with β„“ edges in G tha...
βˆ™ 06/01/2018

Extension Complexity of the Correlation Polytope

We prove that for every n-vertex graph G, the extension complexity of th...
βˆ™ 05/29/2021

Efficient Folding Algorithms for Regular Polyhedra

We investigate the folding problem that asks if a polygon P can be folde...
βˆ™ 06/23/2022

On the complexity of packing rainbow spanning trees

One of the most important questions in matroid optimization is to find d...
βˆ™ 08/22/2022

Digraph Networks and Groupoids

We answer a question posed by Dougherty and Faber in [3], "Network routi...
βˆ™ 10/22/2020

Gaussoids are two-antecedental approximations of Gaussian conditional independence structures

The gaussoid axioms are conditional independence inference rules which c...