ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, and let a proper edge-colouring be an edge-colouring in which edges of the same colour do not meet. A rainbow path is a path whose edges have pairwise distinct colours, and its length is its number of edges. Andersen's conjecture. Every proper edge-colouring of KnK_n has a rainbow path with length n−2n-2. The bound is best possible for powers of 22, but the conjecture is not stated as resolved in the paper.

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.