ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an abelian group, and let KGK_G be the complete graph on vertex set GG, with each edge xyxy coloured by x+yx+y. A copy is rainbow when all its edge colours are distinct.

Chang–Hsu–Rogers conjecture. For every nn-vertex tree TT, the edge-coloured graph KZnK_{\mathbb{Z}_n} contains a rainbow copy of TT.

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 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.