ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, let σn\sigma_n denote the relevant permutation of the vertex set, and let a σn\sigma_n-partition be a partition whose parts are compatible with σn\sigma_n. A transitive σn\sigma_n-orientation is a transitive orientation of the complete graph that is a σn\sigma_n-orientation of the partition.

Odd-order obstruction conjecture. No σn\sigma_n-partition with nn odd has a transitive σn\sigma_n-orientation.

The authors found transitive σn\sigma_n-orientations only for even nn and report that computer searches failed to find examples for odd nn; 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 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.