ABSTRACT
Given a graph H, a graph G is said to be H-saturated if G contains no copy of H as a subgraph, but the addition of any missing edge to G produces a copy of H. Let F = { F 1 , F 2 , … } https://s3-euw1-ap-pe-df-pch-content-public-u.s3.eu-west-1.amazonaws.com/9780429280092/903cf4ed-cbd9-4ecc-bd90-95916cd1752b/content/inline-math7_1.jpg"/> be a finite or infinite class of graphs. The graph G is called F https://s3-euw1-ap-pe-df-pch-content-public-u.s3.eu-west-1.amazonaws.com/9780429280092/903cf4ed-cbd9-4ecc-bd90-95916cd1752b/content/inline-math7_2.jpg"/> -saturated if G does not contain any F i as a subgraph, but some F i occurs whenever any new edge is added to G.
