{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:14:01Z","timestamp":1743135241239,"version":"3.40.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.12101069","No.11901605"],"award-info":[{"award-number":["No.12101069","No.11901605"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-024-00468-6","type":"journal-article","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T20:04:12Z","timestamp":1732910652000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R"],"prefix":"10.1007","volume":"62","author":[{"given":"Zhongzheng","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyang","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"issue":"1","key":"468_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1093\/qmath\/27.1.25","volume":"27","author":"B Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Daykin, D.E., Erd\u00f6s, P.: Sets of independent edges of a hypergraph. Q. J. Math. 27(1), 25\u201332 (1976)","journal-title":"Q. J. Math."},{"issue":"2","key":"468_CR2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT Num. Math. 32(2), 180\u2013196 (1992)","journal-title":"BIT Num. Math."},{"issue":"4","key":"468_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/0206046","volume":"6","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V.: Determining the stability number of a graph. SIAM J. Comput. 6(4), 643\u2013662 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"468_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/rsa.3240060208","volume":"6","author":"RA Duke","year":"1995","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: On uncrowded hypergraphs. Random Struct. Algorithms 6(2\u20133), 209\u2013212 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"468_CR5","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. pp. 1161\u20131165. SIAM (2011)","DOI":"10.1137\/1.9781611973082.87"},{"issue":"1","key":"468_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(83)90003-5","volume":"34","author":"JR Griggs","year":"1983","unstructured":"Griggs, J.R.: Lower bounds on the independence number in terms of the degrees. J. Comb. Theory Ser. B 34(1), 22\u201339 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"468_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230230204","volume":"23","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Zheng, M.: Sharp bounds on the order, size, and stability number of graphs. Networks 23(2), 99\u2013102 (1993)","journal-title":"Networks"},{"issue":"1\u20133","key":"468_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0012-365X(00)00298-3","volume":"232","author":"J Harant","year":"2001","unstructured":"Harant, J., Schiermeyer, I.: On the independence number of a graph in terms of order and size. Discret. Math. 232(1\u20133), 131\u2013138 (2001)","journal-title":"Discret. Math."},{"issue":"4","key":"468_CR9","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1002\/rsa.20830","volume":"54","author":"J Hermon","year":"2019","unstructured":"Hermon, J., Sly, A., Zhang, Y.: Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54(4), 730\u2013767 (2019)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"468_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1002\/rsa.20453","volume":"44","author":"A Kostochka","year":"2014","unstructured":"Kostochka, A., Mubayi, D., Verstra\u00ebte, J.: On independent sets in hypergraphs. Random Struct. Algorithms 44(2), 224\u2013239 (2014)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"468_CR11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0095-8956(91)90080-4","volume":"53","author":"JB Shearer","year":"1991","unstructured":"Shearer, J.B.: A note on the independence number of triangle-free graphs, II. J. Comb. Theory Ser. B 53(2), 300\u2013307 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"468_CR12","volume-title":"A Lower Bound on the Stability Number of a Simple Graph","author":"VK Wei","year":"1981","unstructured":"Wei, V.K.: A Lower Bound on the Stability Number of a Simple Graph. Tech. rep, Bell Laboratories Technical Memorandum Murray Hill, NJ, USA (1981)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00468-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00468-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00468-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:44:17Z","timestamp":1743126257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00468-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00468-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"21 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}