Yokoi's Rainbow Arborescence Conjecture
Statement
Let be a digraph on a vertex set of size , formed as the disjoint union of arborescences on . A subgraph is rainbow if for every color , and an arborescence is spanning if its vertex set is .
Yokoi's Rainbow Arborescence Conjecture. If is the disjoint union of spanning arborescences , then has a rainbow spanning arborescence .
Since a spanning arborescence has arcs, such a uses every color exactly once. The paper reports verification in several cases, while the general conjecture remains open; testing existence with a fixed root is NP-complete.
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.