The Chang–Hsu–Rogers rainbow embedding conjecture
Statement
Let be an abelian group, and let be the complete graph on vertex set , with each edge coloured by . A copy is rainbow when all its edge colours are distinct.
Chang–Hsu–Rogers conjecture. For every -vertex tree , the edge-coloured graph contains a rainbow copy of .
This stronger rainbow-embedding formulation would imply the harmonious labelling conjecture. The paper confirms it for bounded-degree trees, while the general case 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.