{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:20Z","timestamp":1753893860797,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\mathcal{F}$ be a family of $r$-graphs. An $r$-graph $G$ is called $\\mathcal{F}$-saturated if it does not contain any members of $\\mathcal{F}$ but adding any edge creates a copy of some $r$-graph in $\\mathcal{F}$. The saturation number $\\operatorname{sat}(\\mathcal{F},n)$ is the minimum number of edges in an $\\mathcal{F}$-saturated graph on $n$ vertices. We prove that there exists a finite family $\\mathcal{F}$ such that $\\operatorname{sat}(\\mathcal{F},n) \/ n^{r-1}$\u00a0 does not tend to a limit. This settles a question of Pikhurko.<\/jats:p>","DOI":"10.37236\/7727","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:33:51Z","timestamp":1578670431000},"source":"Crossref","is-referenced-by-count":2,"title":["Hypergraph Saturation Irregularities"],"prefix":"10.37236","volume":"25","author":[{"given":"Natalie C.","family":"Behague","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,4,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p11\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:34:10Z","timestamp":1579235650000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,27]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7727","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,4,27]]},"article-number":"P2.11"}}