A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the addition of any edge between non-adjacent vertices in $G$ creates one. While induced subgraphs are often studied in the extremal case with regard to the removal of edges, we extend saturation to induced subgraphs. We say that $G$ is \emph{induced $H$-saturated} if $G$ contains no induced subgraph isomorphic to $H$ and the addition of any edge to $G$ results in an induced copy of $H$. We demonstrate constructively that there are non-trivial examples of saturated graphs for all cycles and an infinite family of paths and find a lower bound on the size of some induced path-saturated graphs.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

ref_tag2016030208.pdf (96 kB)
Supplemental Reference List with DOIs