Obstructions to Total Rainbow Forests in Edge-Colored Graphs

Marwa Mosallam; Thomas Zaslavsky

Obstructions to Total Rainbow Forests in Edge-Colored Graphs

组合数学 2026-06-30 v1

作者: Marwa Mosallam , Thomas Zaslavsky

摘要

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.

引用

@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}
}

备注

24 pages, 19 figures