加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本