Star saturation number of random graphs

Abstract

For a given graph F, the F-saturation number of a graph G is the minimum number of edges in an edge-maximal F-free subgraph of G. Recently, the F-saturation number of the Erdős–Rényi random graph G(n,p) has been determined asymptotically for any complete graph F. In this paper, we give an asymptotic formula for the F-saturation number of G(n,p) when F is a star graph.