{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:00Z","timestamp":1759063740771,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T00:00:00Z","timestamp":1590192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T00:00:00Z","timestamp":1590192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00373-020-02189-2","type":"journal-article","created":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T17:02:23Z","timestamp":1590253343000},"page":"1503-1516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Cuts in $$\\mathscr {H}$$-Free Graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6230-0821","authenticated-orcid":false,"given":"Huawen","family":"Ma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,23]]},"reference":[{"key":"2189_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":"2189_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":"2189_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. Probab. Comput. 14, 629\u2013647 (2005)","journal-title":"Combin. Probab. Comput."},{"key":"2189_CR4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s004939970002","volume":"19","author":"B Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Exact bounds for judicious partitions of graphs. Combinatorica 19, 473\u2013486 (1999)","journal-title":"Combinatorica"},{"key":"2189_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.D.: Problems and results on judicious partitions. Random Struct. Alg. 21, 414\u2013430 (2002)","journal-title":"Random Struct. Alg."},{"key":"2189_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"3","author":"CS Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite graphs. Can. J. Math. 3, 475\u2013485 (1973)","journal-title":"Can. J. Math."},{"key":"2189_CR7","unstructured":"Edwards, C.S.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Proceedings of 2nd Czechoslovak Symposium on Graph Theory, pp. 167\u2013181 (1975)"},{"key":"2189_CR8","first-page":"153","volume-title":"Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977)","author":"P Erd\u00f6s","year":"1979","unstructured":"Erd\u00f6s, P.: Problems and results in graph theory and combinatorial analysis. Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), pp. 153\u2013163. Academic Press, New York (1979)"},{"key":"2189_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., Gallai, T.: Maximal paths and circuits in graphs. Acta Math. Acad. Sci. Hungar. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2189_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.dam.2014.07.002","volume":"179","author":"G Fan","year":"2014","unstructured":"Fan, G., Hou, J., Zeng, Q.: A bound for judicious $$k$$-partitions of graphs. Discret. Appl. Math. 179, 86\u201399 (2014)","journal-title":"Discret. Appl. Math."},{"key":"2189_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s003730170060","volume":"17","author":"Y Li","year":"2001","unstructured":"Li, Y., Rousseau, C., Zang, W.: Asymptotic upper bounds for Ramsey functions. Graphs Combin. 17, 123\u2013128 (2001)","journal-title":"Graphs Combin."},{"key":"2189_CR12","volume-title":"Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1995)"},{"key":"2189_CR13","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.jctb.2010.06.002","volume":"100","author":"J Ma","year":"2010","unstructured":"Ma, J., Yen, P., Yu, X.: On several partitioning problems of Bollob\u00e1s and Scott. J. Combin. Theory, Ser. B 100, 631\u2013649 (2010)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2189_CR14","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1016\/j.disc.2010.03.023","volume":"310","author":"J Ma","year":"2010","unstructured":"Ma, J., Yu, X.: Bounds for pairs in partitions of graphs. Discret. Math. 310, 2069\u20132081 (2010)","journal-title":"Discret. Math."},{"key":"2189_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/S0895480191196824","volume":"7","author":"S Poljak","year":"1994","unstructured":"Poljak, S., Tuza, Z.: Bipartite subgraph of triangle-free graphs. SIAM J. Discret. Math. 7, 307\u2013313 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"2189_CR16","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. Random Struct. Alg. 3, 223\u2013226 (1992)","journal-title":"Random Struct. Alg."},{"key":"2189_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/rsa.3240070305","volume":"7","author":"J Shearer","year":"1995","unstructured":"Shearer, J.: On the independence number of sparse graphs. Random Struct. Alg. 7, 269\u2013271 (1995)","journal-title":"Random Struct. Alg."},{"key":"2189_CR18","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1017\/S0963548311000204","volume":"20","author":"B Xu","year":"2011","unstructured":"Xu, B., Yu, X.: Better bounds for $$k$$-partitions of graphs. Comb. Probab. Comput. 20, 631\u2013640 (2011)","journal-title":"Comb. Probab. Comput."},{"key":"2189_CR19","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. Comb. Theory, Ser. B 106, 30\u201369 (2014)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"2189_CR20","first-page":"253","volume":"20","author":"M Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. STOC 20, 253\u2013264 (1978)","journal-title":"STOC"},{"key":"2189_CR21","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."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02189-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02189-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02189-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T23:15:20Z","timestamp":1621725320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02189-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,23]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2189"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02189-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,5,23]]},"assertion":[{"value":"8 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}