Andersen's rainbow path conjecture
Statement
Let be the complete graph on 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 has a rainbow path with length . The bound is best possible for powers of , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.