The planar high-girth circular chromatic number conjecture

Let GG be a planar graph with girth f(g)f(g).

Circular chromatic number conjecture. If f(g)4gf(g) \geq 4g, then the circular chromatic number of GG is at most 2+1g2+\frac{1}{g}.

This is presented as an important conjecture in the theory of nowhere-zero flows and as a relaxation of Jaeger's Conjecture for planar graphs, via the equivalent dual formulation using circular chromatic number. Its status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen and S Taruni, “On (n,m)-chromatic numbers of graphs having bounded sparsity parameters”, arXiv:2306.08069 (2024).

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.