{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:49:42Z","timestamp":1765176582927,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11861066"],"award-info":[{"award-number":["11861066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"tianshan youth project of xinjiang","award":["2018Q066"],"award-info":[{"award-number":["2018Q066"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p> Let [Formula: see text] be a hypergraph, where [Formula: see text] is a set of vertices and [Formula: see text] is a set of non-empty subsets of [Formula: see text] called edges. If all edges of [Formula: see text] have the same cardinality [Formula: see text], then [Formula: see text] is an [Formula: see text]-uniform hypergraph. A hypergraph [Formula: see text] is called a hypersubgraph of a hypergraph [Formula: see text] if [Formula: see text] and [Formula: see text]. The [Formula: see text]-[Formula: see text] of hypergraph [Formula: see text], denoted by [Formula: see text], is the cardinality of a minimum vertex set [Formula: see text] such that [Formula: see text] is disconnected or is a trival hypergraph. We call [Formula: see text] [Formula: see text]-[Formula: see text] if [Formula: see text]. Tian, Lai and Meng [Y. Z. Tian, H.-J. Lai, J. X. Meng, On the sizes of vertex-[Formula: see text]-maximal [Formula: see text]-uniform hypergraphs, Graphs and Combinatorics 35(5) (2019) 1001\u20131010] conjectered that, for sufficiently large [Formula: see text], every [Formula: see text]-vertex [Formula: see text]-uniform hypergraph with no [Formula: see text]-connected hypersubgraphs has at most [Formula: see text] edges. This upper bound is equal to [Formula: see text] when [Formula: see text]. In this paper, we prove that for [Formula: see text] and [Formula: see text], every [Formula: see text]-vertex [Formula: see text]-uniform hypergraph with no [Formula: see text]-connected hypersubgraphs has at most [Formula: see text] edges. <\/jats:p>","DOI":"10.1142\/s0219265921420202","type":"journal-article","created":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T06:32:57Z","timestamp":1644561177000},"source":"Crossref","is-referenced-by-count":2,"title":["On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs"],"prefix":"10.1142","volume":"22","author":[{"given":"Qinglin","family":"Wang","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1595-9834","authenticated-orcid":false,"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Feng","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,2,10]]},"reference":[{"key":"S0219265921420202BIB001","doi-asserted-by":"publisher","DOI":"10.20429\/tag.2015.020205"},{"key":"S0219265921420202BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.014"},{"key":"S0219265921420202BIB003","volume-title":"Graduate Texts in Mathematics","volume":"244","author":"Bondy J. A.","year":"2008"},{"key":"S0219265921420202BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02993903"},{"key":"S0219265921420202BIB005","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662133.005"},{"key":"S0219265921420202BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070113"},{"key":"S0219265921420202BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-019-02052-z"},{"key":"S0219265921420202BIB008","first-page":"231","volume":"67","author":"Yuster R.","year":"2013","journal-title":"Ars Combinatoria"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921420202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T13:06:49Z","timestamp":1647954409000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921420202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,10]]},"references-count":8,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1142\/S0219265921420202"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921420202","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2022,2,10]]},"article-number":"2142020"}}