On the proper rainbow saturation numbers of cliques, paths, and odd cycles

Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7

Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$…