Li's Hamilton cycle or long path conjecture for colour degree
Statement
Let be an edge-coloured connected graph, and let denote the number of distinct colours on edges incident to a vertex . Write
for the minimum colour degree. A subgraph is properly coloured when consecutive edges have distinct colours. Li's conjecture. If , then contains a properly coloured Hamilton cycle or a properly coloured path of length .
This conjecture strengthens known lower bounds for properly coloured paths and cycles under a minimum colour-degree condition; the source gives no resolution, so its 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.