{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:06:41Z","timestamp":1768723601377,"version":"3.49.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A graph $G$ is said to be $C_l$-saturated if $G$ contains no cycle of length $l$, but for any edge in the complement of $G$ the graph $G+e$ does contain a cycle of length $l$.  The minimum number of edges of a $C_l$-saturated graph was shown by Barefoot et al. to be between $n+c_1{n\\over l}$ and $n+c_2{n\\over l}$ for some positive constants $c_1$ and $c_2$.  This confirmed a conjecture of Bollob\u00e1s.  Here we improve the value of $c_2$ for $l \\geq 8$.<\/jats:p>","DOI":"10.37236\/1055","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:02:58Z","timestamp":1578718978000},"source":"Crossref","is-referenced-by-count":15,"title":["Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size"],"prefix":"10.37236","volume":"13","author":[{"given":"Ronald","family":"Gould","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"\u0141uczak","sequence":"additional","affiliation":[]},{"given":"John","family":"Schmitt","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2006,3,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r29\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r29\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:17:44Z","timestamp":1579321064000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v13i1r29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2006,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1055","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,31]]},"article-number":"R29"}}