3 papers
cs.CG2026
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
math.CO2025
Polynomial extensions of Raimi's theorem
Norbert Hegyvari, Janos Pach, Thang Pham
Raimi's theorem guarantees the existence of a partition of into two parts with an unavoidable intersection property: for any finite coloring of , some colo…
math.CO2025
Immersions and Albertson's conjecture
Jacob Fox, Janos Pach, Andrew Suk
A graph is said to contain (a clique of size ) as a weak immersion if it has vertices, pairwise connected by edge-disjoint paths. In 1989, Lescure and Meyniel made the…