4 papers
A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes
Volker Kaibel, Sebastian Pokutta
Ziegler proved that every simplicial -dimensional -polytope has at most vertices, and asked whether equality forces the polytope to be centrally symmetric and hence, e…
Polytope Extensions with Linear Diameters
Volker Kaibel, Kirill Kukharenko
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorit…
Binary Cyclic Transversal Polytopes
Jonas Frede, Volker Kaibel, Maximilian Merkert
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out tha…
Steiner Cut Dominants
Michele Conforti, Volker Kaibel
For a subset T of nodes of an undirected graph G, a T-Steiner cut is a cut δ(S) where S intersects both T and the complement of T. The T-Steiner cut dominant} of G is the dominant…