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\H{o}s–R\'enyi random graph \mathbbmslG(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 \mathbbmslG(n,p) when F is a star graph.
@article{arxiv.1709.08433,
title = {Star Saturation Number of Random Graphs},
author = {A. Mohammadian and B. Tayfeh-Rezaie},
journal= {arXiv preprint arXiv:1709.08433},
year = {2017}
}