Extremal image-stable graphs Original Research Article

We call a graph image-stable (with respect to some graph image) if, deleting any image edges of image, the remaining graph still contains image as a subgraph. For a fixed image, the minimum number of edges in a image-stable graph is denoted by image. We prove general bounds on image and compute the exact value of the function image for image. The main result can be applied to extremal image-edge-Hamiltonian hypergraphs.