3 papers
math.CO2025
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…
math.CO2024
Generating all invertible matrices by row operations
Petr Gregor, Hung P. Hoang, Arturo Merino +1
We show that all invertible matrices over any finite field can be generated in a Gray code fashion. More specifically, there exists a listing such that…
math.CO2024
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…