ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group and let S⊂GS\subset G. The generalized orbital graph ΓG/H,S\Gamma_{G/H,S} has node set G/HG/H and edge set generated by the pairs {H,gH}\{H,gH\} for g∈Sg\in S. When H={id⁡}H=\{\operatorname{id}\}, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.