Obstructions to Total Rainbow Forests in Edge-Colored Graphs
Combinatorics
2026-06-30 v1
Abstract
A total rainbow forest in an edge-colored graph is a forest that contains every edge color exactly once. Using a necessary and sufficient condition that a total rainbow forest exists, we demonstrate the existence of huge numbers of edge-colored graphs that are minimal obstructions to such existence.
Cite
@article{arxiv.2606.31240,
title = {Obstructions to Total Rainbow Forests in Edge-Colored Graphs},
author = {Marwa Mosallam and Thomas Zaslavsky},
journal= {arXiv preprint arXiv:2606.31240},
year = {2026}
}
Comments
24 pages, 19 figures