Hu–Li conjecture on the upper bound for
Hu–Li conjecture on the upper bound for
Let be a prime, and let be the smallest number such that every planar graph of girth with no cycles of lengths from through admits a homomorphism to the cycle . The Hu–Li conjecture.
Equivalently, every planar graph of girth without cycles of lengths from to is -colorable. The paper proves finite lower and upper bounds for but does not establish this proposed upper bound; it would imply Jaeger's conjecture that every planar graph of girth has a homomorphism to .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.