Tight polyhedral embeddings and relative chromatic number of surfaces with boundary
Abstract
The relative chromatic number c\0(S) of a compact surface S with boundary is defined as the supremum of the chromatic numbers of graphs embedded in S with all vertices on ∂ S. This topological invariant was introduced for the study of the multiplicity of the first Steklov eigenvalue of S. In this article, we show that c\0(S) is also relevant for the study of tight polyhedral embeddings of S byproving two results. The first one is that if there is a tight polyhedral embedding of S in n which is not contained in a hyperplane, then n≤ c\0(S)-1. The second result is that this inequality is sharp for surfaces of small genus.
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.