Felsner–Hurtado–Noy–Streinu conjecture for simple great-circle arrangements

An arrangement of great-circles is a collection of great-circles on the sphere, and its arrangement graph has a vertex at each intersection point and edges given by the circle segments between consecutive intersection points. The arrangement is simple when no three great-circles pass through the same point.

Felsner–Hurtado–Noy–Streinu conjecture. The arrangement graph of every simple arrangement of great-circles on the sphere is 3-colorable.

This conjecture concerns the colorability of arrangement graphs; the paper proves it for the subclass of triangle-saturated great-pseudocircle arrangements, while the general case remains open.

Sources & referencesView supporting material

Primary source

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner and Birgit Vogtenhuber, “Coloring circle arrangements: New 4-chromatic planar graphs”, arXiv:2205.08181 (2022).

Progress summary

Never refreshed

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.