Graph Saturation in Multipartite Graphs

Michael Ferrara, Michael S. Jacobson, Florian Pfender +1

Let $G$ be a fixed graph and let $\mathcal{F}$ be a family of graphs. A subgraph $J$ of $G$ is $\mathcal{F}$-saturated if no member of $\mathcal{F}$ is a subgraph of $J$, but fo…