5 papers · 1 filter
On minimum Venn diagrams
Sofia Brenner, Petr Gregor, Torsten Mütze +1
An -Venn diagram is a diagram in the plane consisting of simple closed curves that intersect only finitely many times such that each of the possible intersections is r…
Disproving two conjectures on the Hamiltonicity of Venn diagrams
Sofia Brenner, Linda Kleist, Torsten Mütze +2
In 1984, Winkler conjectured that every simple Venn diagram with curves can be extended to a simple Venn diagram with curves. His conjecture is equivalent to the statemen…
Listing faces of polytopes
Nastaran Behrooznia, Sofia Brenner, Arturo Merino +3
This paper investigates the problem of listing faces of polytopes that represent combinatorial objects, such as hypercubes, permutahedra, associahedra, and their generalizations. F…
Flips in colorful triangulations
Rohan Acharya, Torsten Mütze, Francesco Verciani
The associahedron is the graph that has as nodes all triangulations of a convex -gon, and an edge between any two triangulations that differ in a flip operation.…
Graphs that admit a Hamilton path are cup-stackable
Petr Gregor, Arturo Merino, Torsten Mütze +1
Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph , which they called cup stacking. Stacks of cups are placed at the vertices of , a…