Sphere coloring conjecture for discrete spheres
Let a -sphere be a finite simple graph defined recursively by requiring every unit sphere to be a -sphere and requiring the deletion of some vertex to be contractible; the empty graph is the -sphere. The chromatic number of a graph is the least number of colors in a proper vertex coloring.
Sphere coloring conjecture. Every -sphere has chromatic number or .
This generalizes the characterization of the four-color theorem in terms of -spheres and proposes the corresponding dimensional bound. The source presents it as an open conjecture, with no proof known in the stated generality.
References
- Oliver Knill, “Eulerian edge refinements, geodesics, billiards and sphere coloring”, arXiv:1808.07207 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.