Chromatic numbers of hyperbolic surfaces

Abstract

This article is about chromatic numbers of hyperbolic surfaces. For a metric space, the d-chromatic number is the minimum number of colors needed to color the points of the space so that any two points at distance d are of a different color. We prove upper bounds on the d-chromatic number of any hyperbolic surface which only depend on d. In another direction, we investigate chromatic numbers of closed genus g surfaces and find upper bounds that only depend on g (and not on d). For both problems, we construct families of examples that show that our bounds are meaningful.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…