Hu–Li conjecture on the upper bound for f(p)f(p)

Let p5p\ge 5 be a prime, and let f(p)f(p) be the smallest number such that every planar graph of girth pp with no cycles of lengths from p+1p+1 through f(p)f(p) admits a homomorphism to the cycle CpC_p. The Hu–Li conjecture.

f(p)p(p2).f(p)\le p(p-2).

Equivalently, every planar graph of girth pp without cycles of lengths from p+1p+1 to p(p2)p(p-2) is CpC_p-colorable. The paper proves finite lower and upper bounds for f(p)f(p) but does not establish this proposed upper bound; it would imply Jaeger's conjecture that every planar graph of girth 2p22p-2 has a homomorphism to CpC_p.

Sources & referencesView supporting material

Primary source

Xiaolan Hu and Jiaao Li, “Circular Coloring and Fractional Coloring in Planar Graphs”, arXiv:2007.00182 (2020).

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.