Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths

Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis +1

Given a finite family $\mathcal{F}$ of graphs, we say that a graph $G$ is "$\mathcal{F}$-free" if $G$ does not contain any graph in $\mathcal{F}$ as a subgraph. A vertex-colored gr…