For a fixed graph F, the minimum number of edges in an edge-maximal F-free subgraph G is called F-saturation number. The asymptotics Erdos–Renyi random G(n, p) for constant \(p\in (0,1)\) was established any complete and star graph. We obtain \(C_m\)-saturation \(m\geqslant 5.\) Also we prove non-trivial linear (in n) lower bounds upper \(C_4\)-saturation some values p.