The cyclic difference rainbow embedding conjecture
Statement
Let be a tree with edges. Let and be two copies of , and form the complete bipartite graph between them by colouring each edge with . A copy is rainbow if all its edge colours are distinct.
Cyclic difference rainbow embedding conjecture. The resulting edge-coloured bipartite graph contains a rainbow embedding of .
Such an embedding would yield the Graham–Häggkvist decomposition by cyclic translations. The paper expects bounded-degree cases to follow from its methods, but the general conjecture 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.