Scott–White multicolour pancyclicity conjecture
Statement
Let , let be an integer, and let be a graph of order with minimum degree
A -edge colouring is a decomposition
where each is a spanning colour class. Scott–White's multicolour conjecture. Either, for every
there is some such that contains , or , is the complete -partite graph with classes of order , and the colouring is a -bipartite -edge colouring.
This conjecture extends the one-colour case of Bondy's theorem and the paper's two-colour result. The supplied text gives no resolution beyond noting these special cases, so its general status 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.