Year: 2025
Type: preprint
Abstract: The rainbow arborescence conjecture posits that if the arcs of a directed graph with $n$ vertices are colored by $n-1$ colors such that each color class forms a spanning arborescence, then there is a spanning arborescence that contains exactly one arc of every color. We prove that the conjecture is true if the underlying undirected graph is a cycle.
Source: arXiv (Cornell University)
Authors: Bérczi, Kristóf, Király, Tamás, Yamaguchi, Yutaro, Yokoi, Yu
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7104622857
Cites:
Cited by:
Related to: