6 papers · 1 filter
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
Sofia Brenner, Justin Dallant, Linda Kleist +3
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…
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 +4
This paper investigates the problem of listing faces of polytopes that represent combinatorial objects, such as hypercubes, permutahedra, associahedra, and their generalizations. F…
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…
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
Sofia Brenner, Jean Cardinal, Thomas McConville +2
For an arrangement of hyperplanes in through the origin, a region is a connected subset of . The graph of regions $G(…
Minimum maximal matchings in permutahedra
Sofia Brenner, JiÅÃ Fink, Hung. P. Hoang +2
We prove that the minimal size of a maximal matching in the permutahedron is asymptotically . On the one hand, we obtain a lower bound $M(Ï_n) \ge n! (n-1)…