{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:54:28Z","timestamp":1776437668098,"version":"3.51.2"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013066","name":"Key Scientific Research Project of Colleges and Universities in Henan Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013066","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.02.037","type":"journal-article","created":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T19:18:34Z","timestamp":1772479114000},"page":"57-75","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On maximum bisections of\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e81\" altimg=\"si23.svg\">\n                      <mml:mrow>\n                        <mml:mo>{<\/mml:mo>\n                        <mml:msub>\n                          <mml:mrow>\n                            <mml:mi>C<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mn>4<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:msub>\n                        <mml:mo>,<\/mml:mo>\n                        <mml:mi>\u03b8<\/mml:mi>\n                        <mml:mrow>\n                          <mml:mo>(<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                          <mml:mo>,<\/mml:mo>\n                          <mml:mn>3<\/mml:mn>\n                          <mml:mo>,<\/mml:mo>\n                          <mml:mn>3<\/mml:mn>\n                          <mml:mo>)<\/mml:mo>\n                        <\/mml:mrow>\n                        <mml:mo>}<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    -free graphs"],"prefix":"10.1016","volume":"387","author":[{"given":"Weiwei","family":"Si","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-7375","authenticated-orcid":false,"given":"Shufei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.037_b1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01261315","article-title":"Bipartite subgraphs","volume":"16","author":"Alon","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2026.02.037_b2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","article-title":"Maximum cuts and judicious partitions in graphs without short cycles","volume":"88","author":"Alon","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.037_b3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1017\/S0963548305007017","article-title":"Maxcut in H-free graphs","volume":"14","author":"Alon","year":"2005","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2026.02.037_b4","first-page":"185","article-title":"Better bounds for max cut","volume":"10","author":"Bollob\u00e1s","year":"2002","journal-title":"Contenporary Comb."},{"key":"10.1016\/j.dam.2026.02.037_b5","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","article-title":"Problems and results on judicious partitions","volume":"21","author":"Bollob\u00e1s","year":"2002","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.dam.2026.02.037_b6","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","article-title":"Some extremal properties of bipartite graphs","volume":"25","author":"Edwards","year":"1973","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.dam.2026.02.037_b7","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, Prague, 1975, pp. 167\u2013181."},{"key":"10.1016\/j.dam.2026.02.037_b8","first-page":"283","article-title":"On even subgraphs of graphs","volume":"18","author":"Erd\u0151s","year":"1967","journal-title":"Mat. Lopok"},{"key":"10.1016\/j.dam.2026.02.037_b9","series-title":"Graph Theory and Related Topics, Proc. Conf. Waterloo, 1977","first-page":"153","article-title":"Problem and results in graph theory and combinatorial analysisin","author":"Erd\u0151s","year":"1979"},{"key":"10.1016\/j.dam.2026.02.037_b10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(97)00004-6","article-title":"The size of the largest bipartite subgraphs","volume":"177","author":"Erd\u0151s","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.02.037_b11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1017\/S0963548317000487","article-title":"Bisections of graphs without short cycles","volume":"27","author":"Fan","year":"2018","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2026.02.037_b12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1112\/jlms.12750","article-title":"New results for MaxCut in H-free graphs","volume":"108","author":"Glock","year":"2023","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2026.02.037_b13","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1002\/jgt.22717","article-title":"On bisections of graphs without complete bipartite graphs","volume":"98","author":"Hou","year":"2021","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.02.037_b14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejc.2017.02.004","article-title":"On bisections of directed graphs","volume":"63","author":"Hou","year":"2017","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.02.037_b15","series-title":"Maximum bisections of graphs without perfect matching","author":"Hou","year":"2024"},{"key":"10.1016\/j.dam.2026.02.037_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2019.07.006","article-title":"Max-bisections of H-free graphs","volume":"343","author":"Hou","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.02.037_b17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s00373-025-02889-7","article-title":"Maximum bisections of graphs without adjacent quadrilaterals","volume":"41","author":"Hu","year":"2025","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.02.037_b18","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.jctb.2013.06.002","article-title":"Bisections of graphs","volume":"103","author":"Lee","year":"2013","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.037_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2021.105404","article-title":"Maximum bisections of graphs without short even cycles","volume":"180","author":"Lin","year":"2021","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.dam.2026.02.037_b20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/S0895480191196824","article-title":"Bipartite subgraphs of triangle-free graphs","volume":"7","author":"Poljak","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.02.037_b21","article-title":"Maximum bisections of graphs without cycles of length 4","volume":"245","author":"Rao","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.02.037_b22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/rsa.3240030211","article-title":"A note on bipartite subgraphs of triangle-free graphs","volume":"3","author":"Shearer","year":"1992","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.dam.2026.02.037_b23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00373-024-02848-8","article-title":"Maximum bisections of graphs with girth at least six","volume":"40","author":"Wu","year":"2024","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.02.037_b24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.dam.2024.08.024","article-title":"Maximum bisections of graphs without cycles of length four and five","volume":"360","author":"Wu","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.037_b25","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1016\/j.disc.2010.03.029","article-title":"A note on balanced bipartitions","volume":"310","author":"Xu","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.02.037_b26","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.jctb.2007.09.001","article-title":"Triangle-free subcubic graphs with minimum bipartite density","volume":"98","author":"Xu","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.037_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0004972716001295","article-title":"Bipartite subgraphs of H-free graphs","volume":"96","author":"Zeng","year":"2017","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.dam.2026.02.037_b28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.26493\/1855-3974.1218.5ed","article-title":"Maximum cuts of graphs with forbidden cycles","volume":"15","author":"Zeng","year":"2018","journal-title":"Ars Math. Contemp."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001162?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001162?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:08:03Z","timestamp":1776434883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":28,"alternative-id":["S0166218X26001162"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.037","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On maximum bisections of -free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.037","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}