On Edge-Colored Saturation Problems

Michael Ferrara, Daniel Johnston, Sarah Loeb +6

Let $\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\mathcal{C},t)$-saturated if $G$ does not contain any graph in $\mathcal{C}$ but the additi…