The circular homomorphism conjecture for planar graphs of girth at least
Let be a positive integer and let be a planar graph whose girth is at least . A homomorphism from to is a map preserving adjacency.
Circular homomorphism conjecture. Every planar graph of girth at least admits a homomorphism to . Equivalently,
This is a well-known conjecture giving a homomorphism bound for planar graphs of large girth; its resolution status is not specified in the source.
References
Primary source
Winfried Hochstättler, Felix Schröder and Raphael Steiner, “On the Complexity of Digraph Colourings and Vertex Arboricity”, arXiv:1812.02420 (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.