On saturation numbers of complete multipartite graphs and even cycles

Abstract

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, we determine asymptotic behavior of $\mathrm{sat}(n,F)$ when $F$ is either a complete multipartite graph or a cycle graph whose length is even and large enough. This extends a result by Bohman, Fonoberova, and Pikhurko from 2010 as well as partially resolves a conjecture of Füredi and Kim from 2013.