# Fooling sets and the Spanning Tree polytope

@article{Khoshkhah2017FoolingSA,
title={Fooling sets and the Spanning Tree polytope},
author={Kaveh Khoshkhah and Dirk Oliver Theis},
journal={Inf. Process. Lett.},
year={2017},
volume={132},
pages={11-13}
}
• Published 2 January 2017
• Mathematics, Computer Science
• Inf. Process. Lett.
4 Citations
This thesis investigates a number of problems related to 2-level polytopes, in particular regarding their combinatorial structure and extension complexity, and gives an output-efficient algorithm to write down extended formulations for the stable set polytope of perfect graphs.
• Mathematics, Computer Science
Electron. J. Comb.
• 2017
The rectangle covering number of an $n$-by-$n$ Boolean matrix $M$ is the smallest number of 1-rectangles which are needed to cover all the 1-entries of $M$. Its binary logarithm is the
• Mathematics
WG
• 2017
This paper proves that the lower bound of the extension complexity of a polytope P is $$\varOmega (n \log n)$$ when G is the incidence graph of a finite projective plane and the upper bound is $$O(\frac{n^2}{\log n})$$, which is an improvement when G has quadratically many edges.

## References

SHOWING 1-10 OF 18 REFERENCES

• Mathematics
Discret. Comput. Geom.
• 2017
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.
i Abstract Typically polytopes arising from real world problems have a lot of facets. In some cases even no linear descriptions for them are known. On the other hand many of these polytopes can be
• Mathematics
CTW
• 2013
Dietzfel-binger, Hromkovic, and Schnitger (1996) showed that n ≤ (rkM)2, regardless of over which field the rank is computed, and asked whether the exponent on rkM can be improved.
• Mathematics
Ann. Oper. Res.
• 2013
This survey presents compact extended formulations for several graph problems involving cuts, trees, cycles and matchings, and for the mixing set, and presents the proof of Fiorini, Massar, Pokutta, Tiwary and de Wolf of an exponential lower bound for the cut polytope.
• Computer Science, Mathematics
CSR
• 2017
An $\Omega(n)$ bound is proved for the cases when: (a) p tends to 0 quickly enough, (b)p tends to $0$ slowly, and (c) $p\in(0,1]$ is a constant.
• Computer Science
Dagstuhl Reports
• 2015
This report documents the program and the outcomes of Dagstuhl Seminar 15082 "Limitations of convex programming: lower bounds on extended formulations and factorization ranks" held in February 2015.