Bounds on Coloring Trees without Rainbow Paths

Wayne Goddard, Tyler Herrman, Simon J. Hughes

For a graph with colored vertices, a rainbow subgraph is one where all vertices have different colors. For graph $G$, let $c_k(G)$ denote the maximum number of different colors in…