ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree with nn edges. Let AA and BB be two copies of Zn\mathbb{Z}_n, and form the complete bipartite graph between them by colouring each edge (a,b)∈A×B(a,b)\in A\times B with b−a∈Znb-a\in\mathbb{Z}_n. 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 TT.

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