2 problems

Let $C_k$ be the cycle on $k$ vertices, and let ${\rm ssat}(n,C_k)$ denote the minimum number of edges in an $n$-vertex graph that is $C_k$-semisaturated, meaning that adding any m…

Let $C_5$ be the cycle on five vertices, and let ${\rm ssat}(n,C_5)$ denote the minimum number of edges in an $n$-vertex graph that is $C_5$-semisaturated, meaning that adding any…