Minimum Ck-saturated graphs

https://doi.org/10.1016/j.endm.2011.09.082Get rights and content

Abstract

A graph G is called H-saturated if it does not contain any copy of H, but for any edge e in the complement of G the graph G+e contains some H. The minimum size of an n-vertex H-saturated graph is denoted by sat(n,H). We provesat(n,Ck)=n+n/k+O((n/k2)+k2) holds for all nk3, where Ck is a cycle with length k.

We conjecture that our constructions are essentially optimal.

References (20)

There are more references available in the full text version of this article.

Cited by (0)

1

Research supported in part by the Hungarian National Science Foundation OTKA, and by the National Science Foundation under grant NFS DMS 09-01276.

View full text