Classification conjecture for Seymour Cayley orientations
Statement
Let be a group and let a Seymour Cayley orientation mean a Cayley orientation in which every vertex has equally large first and second out-neighbourhoods.
Cayley classification conjecture. Every Seymour Cayley orientation can be constructed by taking, possibly repeatedly, lexicographic products of empty graphs, powers of directed cycles, and regular tournaments.
The paper proves this classification for Cayley orientations of abelian groups. The conjecture asks whether the same description holds for Seymour Cayley orientations over arbitrary groups.
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.