Homomorphisms and edge-colourings of planar graphs (Q875942): Difference between revisions

The author conjectures that every planar graph of odd girth \(2k+1\) admits a homomorphism to the Cayley graph \(C(\mathbb{Z}_{2}^{2k+1},S_{2k+1})\), with \(S_{2k+1}\) being the set of \((2k+1)\)-vectors with exactly two consecutive 1's in a cyclic order. The main result is that this conjecture is equivalent to the corresponding case of a conjecture of P. Seymour, stating that every planar \((2k+1)\)-graph is \((2k+1) \)-edge-colorable.