Corpus ID: 235592790

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

@article{Aprile2021SmallerEF,
  title={Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond},
  author={Manuel Aprile and Samuel Fiorini and Tony Huynh and Gwena{\"e}l Joret and David R. Wood},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.11945}
}
Let G be a connected n-vertex graph in a proper minor-closed class G. We prove that the extension complexity of the spanning tree polytope of G is O(n). This improves on the O(n) bounds following from the work of Wong (1980) and Martin (1991). It also extends a result of Fiorini, Huynh, Joret, and Pashkovich (2017), who obtained a O(n) bound for graphs embedded in a fixed surface. Our proof works more generally for all graph classes admitting strongly sublinear balanced separators: We prove… Expand
Extended formulations for matroid polytopes through randomized protocols
TLDR
It is shown that, if P is the base polytope of any matroid, then P admits an extended formulation whose size depends linearly on the hitting number of P, which is the smallest size of a hitting set of the facets of P. Expand

References

SHOWING 1-10 OF 41 REFERENCES
A Separator Theorem for Graphs of Bounded Genus
TLDR
The main result of this paper is that if the authors can draw a graph on a surface of genus g, then they can bisect it by removing $O(\sqrt{gn})$ vertices, best possible to within a constant factor. Expand
Improved approximation algorithms for minimum-weight vertex separators
TLDR
The algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces is developed, and an O(√log n) pseudo-approximation for finding balanced vertices in general graphs is exhibited. Expand
Layered separators in minor-closed graph classes with applications
TLDR
It is proved, for example, that planar graphs and graphs of bounded Euler genus admit layered separators of bounded width, and the minor-closed classes that admit layered separating as those that exclude a fixed apex graph as a minor. Expand
Subgraph polytopes and independence polytopes of count matroids
TLDR
It is shown that these polytopes provide polynomial size extended formulations for independence poly topes of count matroids, which generalizes recent results obtained by Iwata et al. referring to sparsity matroIDS. Expand
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs
TLDR
An O(n2+gn)-size extended formulation for the spanning tree polytope of an n-vertex graph embedded in a surface of genus g is given. Expand
Structure of Graphs with Locally Restricted Crossings
TLDR
Relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces are considered and tight bounds are shown that improve a previously known $O((k+1)^{3/4}n^{1/2})$treewidth bound. Expand
A separator theorem for nonplanar graphs
Let G be an n-vertex graph with no minor isomorphic to an h- vertex complete graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in AExpand
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
TLDR
This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus and shows that any arbitrarily small positive graph G of genus g can be divided in O(n+g) time into components whose sizes do not exceed $\varepsilon n$ by removing a set of $C$ of $O(\sqrt{(g+1/\varePSilon)n})$ vertices. Expand
A Separator Theorem in Minor-Closed Classes
  • K. Kawarabayashi, B. Reed
  • Mathematics, Computer Science
  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
TLDR
It is shown that for each t, there is a separator of size O(t \sqrt{n}) in any $n$-vertex graph G with no $K_t$-minor in any time, and an algorithm aspects of the separator theorem are discussed. Expand
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
TLDR
This paper gives a nondeterministic communication protocol with cost log 2 ( n 2 log n ) + O ( 1 ) for the support of the spanning tree slack matrix. Expand
...
1
2
3
4
5
...