Coloring spheres in 3--manifolds
Geometric Topology
2024-05-20 v1 Combinatorics
Abstract
The sphere graph of , a connect sum of copies of was introduced by Hatcher as an analog of the curve graph of a surface to study the outer automorphism group of a free group . Bestvina, Bromberg, and Fujiwara proved that the chromatic number of the curve graph is finite; bounds were subsequently improved by Gaster, Greene, and Vlamis. Motivated by the analogy, we provide upper and lower bounds for the chromatic number of the sphere graph of . As a corollary to the prime decomposition of 3-manifolds, this gives bounds on the chromatic number of the sphere graph for any orientable 3-manifold.
Cite
@article{arxiv.2405.10932,
title = {Coloring spheres in 3--manifolds},
author = {Edgar A. Bering and Bennett Haffner and Estephanie Ortiz and Olivia Sanchez},
journal= {arXiv preprint arXiv:2405.10932},
year = {2024}
}
Comments
7 pages, 2 figures