The 3-edge-colouring conjecture for cubic Cayley graphs
Statement
Let be a finite group and let . The generalized orbital graph has node set and edge set generated by the pairs for . When , it is a Cayley graph. A cubic Cayley graph is a Cayley graph in which every node has degree three, and a 3-edge colouring is a proper assignment of three colours to its edges so that the three edges incident to each node have distinct colours.
3-edge-colouring conjecture. Every cubic Cayley graph admits a 3-edge colouring.
Such a colouring would provide a way to construct cycle double covers of cubic Cayley graphs, which is relevant to the construction of vertex-transitive graphs and simplicial surfaces with prescribed automorphism groups. The supplied text does not state whether this conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.