{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:31:49Z","timestamp":1754152309786,"version":"3.41.2"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701143"],"award-info":[{"award-number":["11701143"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p> Given two [Formula: see text]-uniform hypergraphs [Formula: see text] and [Formula: see text], we say that [Formula: see text] has an [Formula: see text]-covering if for every vertex in [Formula: see text] there is a copy of [Formula: see text] cover it. For [Formula: see text], the minimum [Formula: see text]-degree [Formula: see text] of [Formula: see text] is the minimum integer such that every [Formula: see text] vertices are contained in at least [Formula: see text] edges. Let [Formula: see text] be the largest minimum [Formula: see text]-degree among all [Formula: see text]-vertex [Formula: see text]-uniform hypergraphs that have no [Formula: see text]-covering. In this paper, we mainly consider the [Formula: see text]-covering problem in [Formula: see text]-uniform hypergraphs. When [Formula: see text] is a generalized triangle [Formula: see text], we give the exact value of [Formula: see text] and asymptotically determine [Formula: see text]. Moreover, when [Formula: see text] is a linear [Formula: see text]-path [Formula: see text] or a star [Formula: see text], we provide bounds of [Formula: see text] and [Formula: see text] for [Formula: see text], where [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054125460037","type":"journal-article","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T02:57:36Z","timestamp":1745377056000},"page":"841-865","source":"Crossref","is-referenced-by-count":0,"title":["The Degree and Codegree Threshold for Generalized Triangle and Some Trees Covering"],"prefix":"10.1142","volume":"36","author":[{"given":"Ran","family":"Gu","sequence":"first","affiliation":[{"name":"School of Mathematics, Hohai University, Nanjing, Jiangsu Province 210098, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7427-6700","authenticated-orcid":false,"given":"Shuaichao","family":"Wang","sequence":"additional","affiliation":[{"name":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"S0129054125460037BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/15M1051452"},{"key":"S0129054125460037BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000061"},{"key":"S0129054125460037BIB003","doi-asserted-by":"publisher","DOI":"10.37236\/8784"},{"issue":"2022","key":"S0129054125460037BIB005","volume":"10","author":"Freschi A.","year":"2022","journal-title":"Forum of Mathematics, Sigma"},{"key":"S0129054125460037BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/21M1450227"},{"issue":"3","key":"S0129054125460037BIB008","first-page":"337","volume":"10","author":"Erd\u0151s P.","year":"1959","journal-title":"Acta Mathematica Hungarica"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125460037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T03:44:26Z","timestamp":1753155866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125460037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":6,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.1142\/S0129054125460037"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125460037","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2025,4,22]]}}}