The game of image-saturator Original Research Article

Let image be a graph and image be a family of graphs. We say that image is image-saturated if image does not contain a copy of any member of image, but for any pair of nonadjacent vertices image and image in image, image contains a copy of some image. A great deal of study has been devoted to the maximum and the minimum number of edges in an image-saturated graph. Little is known, however, about image-saturated graphs of other sizes or, alternatively, about the image-saturated subgraphs of an arbitrary graph image.