On decidability of hyperbolicity
Abstract
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.