The sphere graph of Mᵣ, a connect sum of r copies of S¹× S² was introduced by Hatcher as an analog of the curve graph of a surface to study the outer automorphism group of a free group Fᵣ. 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 Mᵣ. 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.
No takes yet. Share an insight, caveat, or question.
Bering et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: