{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:17:35Z","timestamp":1760573855773,"version":"build-2065373602"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":["12261086"],"award-info":[{"award-number":["12261086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00373-025-02961-2","type":"journal-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T09:20:56Z","timestamp":1757928056000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Sizes of Bi-k-Edge-Maximal r-Uniform Hypergraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Qinglin","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1595-9834","authenticated-orcid":false,"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"1","key":"2961_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/jgt.22008","volume":"84","author":"J Anderson","year":"2017","unstructured":"Anderson, J., Lai, H.-J., Lin, X.X., Xu, M.R.: On $$k$$-maximal strength digraphs. J. Graph Theory 84(1), 17\u201325 (2017)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2961_CR2","first-page":"5","volume":"2","author":"MA Bahmanian","year":"2015","unstructured":"Bahmanian, M.A., \u0160ajna, M.: Connection and separation in hypergraphs. Theory Appl. Graphs 2(2), 5 (2015)","journal-title":"Theory Appl. Graphs"},{"key":"2961_CR3","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics. Springer, Berlin (2008)"},{"issue":"1","key":"2961_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.disc.2015.07.008","volume":"339","author":"P Dankelmann","year":"2016","unstructured":"Dankelmann, P., Meierling, D.: Maximally edge-connected hypergraphs. Discret. Math. 339(1), 33\u201338 (2016)","journal-title":"Discret. Math."},{"issue":"2","key":"2961_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.4153\/CMB-2018-005-9","volume":"61","author":"M Dewar","year":"2016","unstructured":"Dewar, M., Pike, D., Proos, J.: Connectivity in hypergraphs. Can. Math. Bull. 61(2), 252\u2013271 (2016)","journal-title":"Can. Math. Bull."},{"key":"2961_CR6","first-page":"93","volume-title":"Graphs and Numbers, Bolyai Society Mathematical Studies","author":"A Frank","year":"2006","unstructured":"Frank, A.: Edge-connection of graphs, digraphs, and hypergraphs. In: Sets, M. (ed.) Graphs and Numbers, Bolyai Society Mathematical Studies, vol. 15, pp. 93\u2013141. Spring, Berlin (2006)"},{"issue":"2","key":"2961_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190140207","volume":"14","author":"H-J Lai","year":"1990","unstructured":"Lai, H.-J.: The size of strength-maximal graphs. J. Graph Theory 14(2), 187\u2013197 (1990)","journal-title":"J. Graph Theory"},{"key":"2961_CR8","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.dam.2019.01.009","volume":"260","author":"H Lei","year":"2019","unstructured":"Lei, H., Suil, O., Shi, Y., West, D.B., Zhu, X.: Extremal problems on saturation for the family of $$k$$-edge-connected graphs. Discret. Appl. Math. 260, 278\u2013283 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"10","key":"2961_CR9","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.1016\/j.disc.2016.04.007","volume":"339","author":"XX Lin","year":"2016","unstructured":"Lin, X.X., Fan, S.H., Lai, H.-J., Xu, M.R.: On the lower bound of $$k$$-maximal digraphs. Discret. Math. 339(10), 2500\u20132510 (2016)","journal-title":"Discret. Math."},{"key":"2961_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W Mader","year":"1971","unstructured":"Mader, W.: Minimale $$n$$-fach kantenzusammenh$$\\ddot{a}$$ngende graphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"2961_CR11","doi-asserted-by":"crossref","unstructured":"D. W. Matula, The cohesive strength of graphs, In: The Many Facets of Graph Theory, Lecture Notes in Mathematics vol. 110, pp. 215-221. Springer, Berlin (1969)","DOI":"10.1007\/BFb0060120"},{"issue":"2","key":"2961_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0893-9659(98)00145-1","volume":"12","author":"J Nieminen","year":"1999","unstructured":"Nieminen, J., Peltola, M.: Hypertrees. Appl. Math. Lett. 12(2), 35\u201338 (1999)","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"2961_CR13","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s10255-022-1095-3","volume":"38","author":"YZ Tian","year":"2022","unstructured":"Tian, Y.Z., Lai, H.-J., Meng, J.X., Xu, L.Q.: On the sizes of $$k$$-edge-maximal $$r$$-uniform hypergraphs. Acta Math. Appl. Sin. Engl. Ser. 38(3), 532\u2013539 (2022)","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"key":"2961_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10878-020-00522-2","volume":"39","author":"LQ Xu","year":"2020","unstructured":"Xu, L.Q., Tian, Y.Z., Lai, H.-J.: On the sizes of bi-$$k$$-maximal graphs. J. Comb. Optim. 39, 859\u2013873 (2020)","journal-title":"J. Comb. Optim."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02961-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:29Z","timestamp":1760505089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02961-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2961"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02961-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"18 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"102"}}