ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a digraph on a vertex set VV of size n≥2n \ge 2, formed as the disjoint union of arborescences A1,…,AkA_1,\ldots,A_k on VV. A subgraph BB is rainbow if ∣B∩Ai∣≤1|B \cap A_i| \le 1 for every color ii, and an arborescence is spanning if its vertex set is VV.

Yokoi's Rainbow Arborescence Conjecture. If GG is the disjoint union of n−1n-1 spanning arborescences A1,A2,…,An−1A_1, A_2, \dots, A_{n-1}, then GG has a rainbow spanning arborescence BB.

Since a spanning arborescence has n−1n-1 arcs, such a BB 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 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.