On saturation numbers of complete multipartite graphs and even cycles

Ali Mohammadian, Milad Poursoltani, Behruz Tayfeh-Rezaie

Given positive integer $n$ and graph $F$, the saturation number $\mathrm{sat}(n,F)$ is the minimum number of edges in an edge-maximal $F$-free graph on $n$ vertices. In this paper…