{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:47Z","timestamp":1753893827540,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Given two $3$-graphs $F$ and $H$, an $F$-covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let $c_2(n,F)$ be the minimum integer $t$ such that every 3-graph with minimum codegree greater than $t$ has an $F$-covering.\u00a0 In this note, we answer an open problem of Falgas-Ravry and Zhao (SIAM J. Discrete Math., 2016) by determining the exact value of $c_2(n, K_4^-)$ and $c_2(n, K_5^-)$, where $K_t^-$ is the complete $3$-graph on $t$ vertices with one edge removed.<\/jats:p>","DOI":"10.37236\/8784","type":"journal-article","created":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T02:48:24Z","timestamp":1599187704000},"source":"Crossref","is-referenced-by-count":1,"title":["Exact Minimum Codegree Thresholds  for $K_4^-$-Covering and $K_5^-$-Covering"],"prefix":"10.37236","volume":"27","author":[{"given":"Lei","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinmin","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,8,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p22\/8140","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p22\/8140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T02:48:24Z","timestamp":1599187704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i3p22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,7]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,7,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8784","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,8,7]]},"article-number":"P3.22"}}