
Smaller extended formulations for spanning tree polytopes in minorclosed classes and beyond
Let G be a connected nvertex graph in a proper minorclosed class π’. We...
read it

Decomposition of (2k+1)regular graphs containing special spanning 2kregular 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...
read it

Extension Complexity of the Correlation Polytope
We prove that for every nvertex graph G, the extension complexity of th...
read it

Efficient Folding Algorithms for Regular Polyhedra
We investigate the folding problem that asks if a polygon P can be folde...
read it

On the Complexity of the Bilevel Minimum Spanning Tree Problem
We consider the bilevel minimum spanning tree (BMST) problem where the l...
read it

Gaussoids are twoantecedental approximations of Gaussian conditional independence structures
The gaussoid axioms are conditional independence inference rules which c...
read it

Continuous Regular Functions
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function...
read it
Regular matroids have polynomial extension complexity
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.
READ FULL TEXT
Comments
There are no comments yet.