{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:43Z","timestamp":1759336003812,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $G$ be a graph. We say an $r$-uniform hypergraph $H$ is a Berge-$G$ if there exists a bijection $\\phi: E(G)\\to E(H)$ such that $e\\subseteq\\phi(e)$ for each $e\\in E(G)$. Given a family of $r$-uniform hypergraphs $\\mathcal{F}$ and an $r$-uniform hypergraph $H$, a spanning sub-hypergraph $H'$ of $H$ is $\\mathcal{F}$-saturated in $H$ if $H'$ is $\\mathcal{F}$-free, but adding any edge in $E(H)\\backslash E(H')$ to $H'$ creates a copy of some $F\\in\\mathcal{F}$. The saturation number of $\\mathcal{F}$ is the minimum number of edges in an $\\mathcal{F}$-saturated spanning sub-hypergraph of $H$. In this paper, we asymptotically determine the saturation number of Berge stars in random $r$-uniform hypergraphs.<\/jats:p>","DOI":"10.37236\/9302","type":"journal-article","created":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T08:21:38Z","timestamp":1608020498000},"source":"Crossref","is-referenced-by-count":1,"title":["Saturation Number of Berge Stars in Random Hypergraphs"],"prefix":"10.37236","volume":"27","author":[{"given":"Lele","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changxiang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,12,11]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p45\/8226","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p45\/8226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T08:21:38Z","timestamp":1608020498000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,11]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/9302","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,12,11]]},"article-number":"P4.45"}}