Tight concentration of star saturation number in random graphs

Sergej Demyanov, Maksim Zhukovskii

For given graphs $F$ and $G$, the minimum number of edges in an inclusion-maximal $F$-free subgraph of $G$ is called the $F$-saturation number and denoted $\mathrm{sat}(G,F)$. For…