2000 character limit reached
Asymptotic connectivity, hamiltonicity and toughness
Published 7 Oct 2026 in math.CO, math.GR, and math.MG | (2610.09992v1)
Abstract: We define coarse variants of the notions of connectivity, hamiltonicity, toughness, and spanning trees. Our notions are invariant under quasi-isometries, and they obey the same relationships between them as their classical analogs. We pose several open problems that are coarse versions of classical results and conjectures about hamiltonicity.
Paper Prompts
Sign up for free to create and run prompts on this paper.