arXiv (All)
open access
(Approximate) Symmetric Extension Complexity of the Spanning Tree Polytope
We prove a tight lower bound on symmetric LP formulations for the spanning tree polytope of the complete graph. More precisely, let $P_{ST}(K_n)$ be the spanning tree polytope of $K_n$. We show that, for all $n\ge13$, every symmetric extended formulation for $P_{ST}(K_n)$ has at least $\binom n3$ in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp planar Turán bounds for quasi-double stars#1201719
- Sharp spectral lower bounds for the booksize of a graph#1033994
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1169673
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1145185
- Optimally large cuts in both directions#1356717
Record · ID 1342529
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive