Neal Bushaw, Edge-colored Extremal Problems
Room B332 IBS (기초과학연구원)An edge-colored graph $H$ is called rainbow if all of its edges are given distinct colors. An edge-colored graph $G$ is then called rainbow $H$-free when no copy of $H$ in $G$ is rainbow. With this, we define a graph $G$ to be rainbow $H$-saturated when there is some proper edge-coloring of $G$ which is rainbow $H$-free, …