{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T07:11:28Z","timestamp":1772521888707,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"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":["11801149"],"award-info":[{"award-number":["11801149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Universities of Henan Province","award":["NSFRF240316"],"award-info":[{"award-number":["NSFRF240316"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00373-024-02848-8","type":"journal-article","created":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:02:38Z","timestamp":1729641758000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Bisections of Graphs with Girth at Least Six"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-7375","authenticated-orcid":false,"given":"Shufei","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xiaobei","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"key":"2848_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01261315","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N.: Bipartite subgraphs. Combinatorica 16, 301\u2013311 (1996)","journal-title":"Combinatorica"},{"key":"2848_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","volume":"88","author":"N Alon","year":"2003","unstructured":"Alon, N., Bollob\u00e1s, B., Krivelevich, M., Sudakov, B.: Maximum cuts and judicious partitions in graphs without short cycles. J. Combin. Theory Ser. B 88, 329\u2013346 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2848_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0963548305007017","volume":"14","author":"N Alon","year":"2005","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Maxcut in $$H$$-free graphs. Combin. Prob. Comput. 14, 629\u2013647 (2005)","journal-title":"Combin. Prob. Comput."},{"key":"2848_CR4","first-page":"185","volume":"10","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B., Scott, A.: Better bounds for max cut. Contenp. Combin. 10, 185\u2013246 (2002)","journal-title":"Contenp. Combin."},{"key":"2848_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B., Scott, A.: Problems and results on judicious partitions. Rand. Struct. Algorithms 21, 414\u2013430 (2002)","journal-title":"Rand. Struct. Algorithms"},{"key":"2848_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"CS Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite graphs. Can. J. Math. 25, 475\u2013485 (1973)","journal-title":"Can. J. Math."},{"key":"2848_CR7","unstructured":"C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph. In: Proceedings of the Second Czechoslovak Symposium on Graph Theory, 167\u2013181 (1975)"},{"key":"2848_CR8","unstructured":"P. Erd\u0151s, Problem and results in graph theory and combinatorial analysis. In: Graph Theory and Related Topics, 153\u2013163 (1979)"},{"key":"2848_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0012-365X(97)00004-6","volume":"177","author":"P Erd\u0151s","year":"1997","unstructured":"Erd\u0151s, P., Gy\u00e1rf\u00e1s, A., Kohayakawa, Y.: The size of the largest bipartite subgraphs. Disc. Math. 177, 267\u2013271 (1997)","journal-title":"Disc. Math."},{"key":"2848_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1017\/S0963548317000487","volume":"27","author":"G Fan","year":"2018","unstructured":"Fan, G., Hou, J., Yu, X.: Bisections of graphs without short cycles. Combin. Prob. Comput. 27, 44\u201359 (2018)","journal-title":"Combin. Prob. Comput."},{"key":"2848_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1112\/jlms.12750","volume":"108","author":"S Glock","year":"2023","unstructured":"Glock, S., Janzer, O., Sudakov, B.: New results for MaxCut in $$H$$-free graphs. J. Lond. Math. Soc. 108, 441\u2013481 (2023)","journal-title":"J. Lond. Math. Soc."},{"key":"2848_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ejc.2017.02.004","volume":"63","author":"J Hou","year":"2017","unstructured":"Hou, J., Wu, S., Yan, G.: On bisections of directed graphs. Eur. J. Combin. 63, 44\u201358 (2017)","journal-title":"Eur. J. Combin."},{"key":"2848_CR13","doi-asserted-by":"publisher","first-page":"3288","DOI":"10.1016\/j.disc.2018.08.015","volume":"341","author":"J Hou","year":"2018","unstructured":"Hou, J., Ma, H., Yu, J., Zhang, X.: On partitions of $$K_{2,3}$$-free graphs under degree constraints. Disc. Math. 341, 3288\u20133295 (2018)","journal-title":"Disc. Math."},{"key":"2848_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.07.006","volume":"343","author":"J Hou","year":"2020","unstructured":"Hou, J., Yan, J.: Max-bisections of $$H$$-free graphs. Disc. Math. 343, 111590 (2020)","journal-title":"Disc. Math."},{"key":"2848_CR15","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1002\/jgt.22717","volume":"98","author":"J Hou","year":"2021","unstructured":"Hou, J., Wu, S.: On bisections of graphs without complete bipartite graphs. J. Graph Theory 98, 630\u2013641 (2021)","journal-title":"J. Graph Theory"},{"key":"2848_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.jctb.2019.03.001","volume":"139","author":"Y Ji","year":"2019","unstructured":"Ji, Y., Ma, J., Yan, J., Yu, X.: On problems about judicious bipartitions of graphs. J. Combin. Theory Ser. B 139, 230\u2013250 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2848_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2018.12.022","volume":"259","author":"J Jin","year":"2019","unstructured":"Jin, J., Xu, B.: Bisections of graphs without $$K_{2, l}$$. Disc. Appl. Math. 259, 112\u2013118 (2019)","journal-title":"Disc. Appl. Math."},{"key":"2848_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6","volume-title":"VLSI Physical Design: From Graph Partitioning to Timing Closure","author":"A Kahng","year":"2011","unstructured":"Kahng, A., Lienig, J., Markov, I., Hu, J.: VLSI Physical Design: From Graph Partitioning to Timing Closure. Springer, Berlin (2011)"},{"key":"2848_CR19","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.jctb.2013.06.002","volume":"103","author":"C Lee","year":"2013","unstructured":"Lee, C., Loh, P., Sudakov, B.: Bisections of graphs. J. Combin. Theory Ser. B 103, 599\u2013629 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2848_CR20","first-page":"80","volume":"42","author":"J Lin","year":"2019","unstructured":"Lin, J.: A note on bisections of graphs with girth at least 6. Italian J. Pure Appl. Math. 42, 80\u201387 (2019)","journal-title":"Italian J. Pure Appl. Math."},{"key":"2848_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105404","volume":"180","author":"J Lin","year":"2021","unstructured":"Lin, J., Zeng, Q.: Maximum bisections of graphs without short even cycles. J. Combin. Theory Ser. A 180, 105404 (2021)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2848_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"2848_CR23","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1109\/TPDS.2017.2671868","volume":"28","author":"H Meyerhenke","year":"2017","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Parallel graph partitioning for complex networks. IEEE Trans. Parallel Distrib. Syst. 28, 2625\u20132638 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2848_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/S0895480191196824","volume":"7","author":"S Poljak","year":"1994","unstructured":"Poljak, S., Tuza, Z.S.: Bipartite subgraphs of triangle-free graphs. SIAM J. Disc. Math. 7, 307\u2013313 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"2848_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112914","volume":"245","author":"M Rao","year":"2022","unstructured":"Rao, M., Hou, J., Zeng, Q.: Maximum bisections of graphs without cycles of length 4. Disc. Math. 245, 112914 (2022)","journal-title":"Disc. Math."},{"key":"2848_CR26","first-page":"95","volume":"327","author":"A Scott","year":"2005","unstructured":"Scott, A.: Judicious partitions and related problems. Surv. Combin. 327, 95\u2013117 (2005)","journal-title":"Surv. Combin."},{"key":"2848_CR27","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/rsa.3240030211","volume":"3","author":"J Shearer","year":"1992","unstructured":"Shearer, J.: A note on bipartite subgraphs of triangle-free graphs. Rand. Struct. Algorithms 3, 223\u2013226 (1992)","journal-title":"Rand. Struct. Algorithms"},{"key":"2848_CR28","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s12190-017-1080-9","volume":"56","author":"M Sun","year":"2018","unstructured":"Sun, M., Sun, H., Wang, Y.: Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit. J. Appl. Math. Comput. 56, 411\u2013438 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"2848_CR29","doi-asserted-by":"crossref","unstructured":"Wu, S., Li, A.: Max-cut by excluding bipartite subgraphs. Bull. Aust. Math. Soc. 1\u201310 (2022)","DOI":"10.1017\/S0004972722001174"},{"key":"2848_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/09728600.2022.2148589","volume":"20","author":"S Wu","year":"2023","unstructured":"Wu, S., Hou, J.: Graph partitioning: an updated survey. AKCE Int. J. Graphs Combin. 20, 9\u201319 (2023)","journal-title":"AKCE Int. J. Graphs Combin."},{"key":"2848_CR31","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jctb.2014.01.004","volume":"106","author":"B Xu","year":"2014","unstructured":"Xu, B., Yu, X.: On judicious bisections of graphs. J. Combin. Theory Ser. B 106, 30\u201369 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2848_CR32","doi-asserted-by":"publisher","first-page":"2613","DOI":"10.1016\/j.disc.2010.03.029","volume":"310","author":"B Xu","year":"2010","unstructured":"Xu, B., Yan, J., Yu, X.: A note on balanced bipartitions. Disc. Math. 310, 2613\u20132617 (2010)","journal-title":"Disc. Math."},{"key":"2848_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0004972716001295","volume":"96","author":"Q Zeng","year":"2017","unstructured":"Zeng, Q., Hou, J.: Bipartite subgraphs of $$H$$-free graphs. Bull. Aust. Math. Soc. 96, 1\u201313 (2017)","journal-title":"Bull. Aust. Math. Soc."},{"key":"2848_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.26493\/1855-3974.1218.5ed","volume":"15","author":"Q Zeng","year":"2018","unstructured":"Zeng, Q., Hou, J.: Maximum cuts of graphs with forbidden cycles. Ars Math. Contemp. 15, 147\u2013160 (2018)","journal-title":"Ars Math. Contemp."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02848-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02848-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02848-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:06Z","timestamp":1733515626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02848-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2848"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02848-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"31 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":4,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Confict of Interest"}}],"article-number":"113"}}