23 citations · 24 across the 7 of their papers we have counts for
8 papers
The face lattice of any simplicial polytope is Hamiltonian
Robert Lauff
We show that the face lattice of any simplicial polytope is Hamiltonian. This proves a major part of a recent conjecture by \citeauthor{Listingfaces} which states that the face lat…
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…
On Triangles in Colored Pseudoline Arrangements
Yan Alves Radtke, Balázs Keszegh, Robert Lauff
We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Björner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence…
Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra
Robert Lauff, Lucca Tiemens
We settle the problem of constructing a balanced transposition Gray code for permutations of with . More generally, we obta…
On Triangular Separation of Bichromatic Point Sets
Helena Bergold, Arun Kumar Das, Robert Lauff +3
We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in . A set of triangles is a \emph{separ…
Humanity's Last Exam
Long Phan, Alice Gatti, Ziwen Han +1168
Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achi…
Facet-Hamiltonicity
Hugo Akitaya, Jean Cardinal, Stefan Felsner +2
We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watc…
Subgraph-universal planar graphs for trees
Helena Bergold, Vesna Iršič, Robert Lauff +3
We show that there exists an outerplanar graph on vertices for that contains every tree on vertices as a subgraph. This exten…