The odd-order obstruction conjecture for transitive n-partition orientations
Statement
Let be a positive integer, let denote the relevant permutation of the vertex set, and let a -partition be a partition whose parts are compatible with . A transitive -orientation is a transitive orientation of the complete graph that is a -orientation of the partition.
Odd-order obstruction conjecture. No -partition with odd has a transitive -orientation.
The authors found transitive -orientations only for even and report that computer searches failed to find examples for odd ; the conjecture remains open.
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.