{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:39Z","timestamp":1765164099009,"version":"3.46.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1006400"],"award-info":[{"award-number":["2022YFA1006400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201390"],"award-info":[{"award-number":["12201390"]}],"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,12]]},"DOI":"10.1007\/s00373-025-02993-8","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:05:54Z","timestamp":1763139954000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An upper bound for a ramsey type problem for k-connected subgraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Murong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Qiqin","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"issue":"2","key":"2993_CR1","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.disc.2015.10.014","volume":"339","author":"A Bernshteyn","year":"2016","unstructured":"Bernshteyn, A., Kostochka, A.: On the number of edges in a graph with no (k+1)-connected subgraphs. Discret. Math. 339(2), 682\u2013688 (2016)","journal-title":"Discret. Math."},{"issue":"9","key":"2993_CR2","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.disc.2006.01.030","volume":"308","author":"B Bollob\u00e1s","year":"2008","unstructured":"Bollob\u00e1s, B., Gy\u00e1rf\u00e1s, A.: Highly connected monochromatic subgraphs. Discret. Math. 308(9), 1722\u20131725 (2008)","journal-title":"Discret. Math."},{"key":"2993_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3 edn. Springer, Berlin, Heidelberg (2006). Corrected printing (2006)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"2993_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.endm.2016.09.019","volume":"54","author":"S Fujita","year":"2016","unstructured":"Fujita, S., Liu, H., Sarkar, A.: Highly connected subgraphs of graphs with given independence number. Electronic Notes in Discrete Mathematics 54, 103\u2013108 (2016)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2993_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.ejc.2018.01.004","volume":"70","author":"S Fujita","year":"2018","unstructured":"Fujita, S., Liu, H., Sarkar, A.: Highly connected subgraphs of graphs with given independence number. Eur. J. Comb. 70, 212\u2013231 (2018)","journal-title":"Eur. J. Comb."},{"key":"2993_CR6","doi-asserted-by":"crossref","unstructured":"Fujita, S., Magnant, C.: Note on highly connected monochromatic subgraphs in $$2 $$-colored complete graphs. the electronic journal of combinatorics pp. P15\u2013P15 (2011)","DOI":"10.37236\/502"},{"key":"2993_CR7","doi-asserted-by":"crossref","unstructured":"Jin, Z.m., Wang, Y.l., Wen, S.l.: Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs. Applied Mathematics-A Journal of Chinese Universities 29(2), 249\u2013252 (2014)","DOI":"10.1007\/s11766-014-2859-1"},{"issue":"1","key":"2993_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1002\/jgt.20365","volume":"61","author":"H Liu","year":"2009","unstructured":"Liu, H., Morris, R., Prince, N.: Highly connected monochromatic subgraphs of multicolored graphs. Journal of Graph Theory 61(1), 22\u201344 (2009)","journal-title":"Journal of Graph Theory"},{"key":"2993_CR9","unstructured":"Lo, C., Wu, H., Xie, Q.: A ramsey type problem for highly connected subgraphs. arXiv preprint arXiv:2008.09001 (2020)"},{"key":"2993_CR10","doi-asserted-by":"crossref","unstructured":"Mader, W.: Existenz n-fach zusammenh\u00e4ngender teilgraphen in graphen gen\u00fcgend grosser kantendichte. In: Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg, 37(1), 86\u201397. Springer (1972)","DOI":"10.1007\/BF02993903"},{"issue":"2","key":"2993_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20429\/tag.2019.060201","volume":"6","author":"C Magnant","year":"2019","unstructured":"Magnant, C.: Colored complete hypergraphs containing no rainbow berge triangles. Theory and Applications of Graphs 6(2), 1 (2019)","journal-title":"Theory and Applications of Graphs"},{"issue":"1","key":"2993_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.3190070113","volume":"7","author":"DW Matula","year":"1983","unstructured":"Matula, D.W.: Ramsey theory for graph connectivity. Journal of Graph Theory 7(1), 95\u2013103 (1983)","journal-title":"Journal of Graph Theory"},{"key":"2993_CR13","doi-asserted-by":"crossref","unstructured":"Ramsey, F.P.: On a problem of formal logic. In: Classic Papers in Combinatorics, 1\u201324. Springer (1987)","DOI":"10.1007\/978-0-8176-4842-8_1"},{"issue":"5","key":"2993_CR14","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s00373-019-02052-z","volume":"35","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Lai, H.J., Meng, J.: On the sizes of vertex-k-maximal r-uniform hypergraphs. Graphs and Combinatorics 35(5), 1001\u20131010 (2019)","journal-title":"Graphs and Combinatorics"},{"issue":"01","key":"2993_CR15","doi-asserted-by":"publisher","first-page":"2142020","DOI":"10.1142\/S0219265921420202","volume":"22","author":"Q Wang","year":"2022","unstructured":"Wang, Q., Tian, Y., Feng, L.: On the number of edges in a 3-uniform hypergraph with no (k+ 1)-connected hypersubgraphs. Journal of Interconnection Networks 22(01), 2142020 (2022)","journal-title":"Journal of Interconnection Networks"},{"key":"2993_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.dam.2020.06.003","volume":"285","author":"L Xu","year":"2020","unstructured":"Xu, L., Lai, H.J., Tian, Y.: On the extremal sizes of maximal graphs without (k+ 1)-connected subgraphs. Discret. Appl. Math. 285, 397\u2013406 (2020)","journal-title":"Discret. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02993-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02993-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02993-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:32Z","timestamp":1765164032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02993-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2993"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02993-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,11,14]]},"assertion":[{"value":"28 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 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 declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"128"}}