Datensatz

Zusammenfassung

In 1991, Yannakakis [17] proved that no symmetric extended formulation for the matching polytope of the complete graph K n with n nodes has a number of variables and constraints that is bounded subexponentially in n. Here, symmetric means that the formulation remains invariant under all permutations of the nodes of K n . It was also conjectured in [17] that “asymmetry does not help much,” but no corresponding result for general extended formulations has been found so far. In this paper we show that for the polytopes associated with the matchings in K n with logn edges there are non-symmetric extended formulations of polynomial size, while nevertheless no symmetric extended formulation of polynomial size exists. We furthermore prove similar statements for the polytopes associated with cycles of length logn . Thus, with respect to the question for smallest possible extended formulations, in general symmetry requirements may matter a lot. © Springer, Part of Springer Science+Business Media [accessed 2014 January 31st]