{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:05:05Z","timestamp":1770422705238,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5645,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0012-365x(97)00041-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"19-29","source":"Crossref","is-referenced-by-count":25,"title":["Bipartite subgraphs of integer weighted graphs"],"prefix":"10.1016","volume":"181","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Eran","family":"Halperin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00041-1_BIB1","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\/S0012-365X(97)00041-1_BIB2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","article-title":"Some extremal properties of bipartite subgraphs","volume":"3","author":"Edwards","year":"1973","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0012-365X(97)00041-1_BIB3","series-title":"Proc. 2nd Czechoslovak Symposium on Graph Theory","first-page":"167","article-title":"An improved lower bound for the number of edges in a largest bipartite subgraph","author":"Edwards","year":"1975"},{"key":"10.1016\/S0012-365X(97)00041-1_BIB4","doi-asserted-by":"crossref","unstructured":"P. Erd\u00f6s, A. Gy\u00e1rf\u00e1s, Y. Kohayakawa, The size of the largest bipartite subgraph, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(97)00004-6"},{"key":"10.1016\/S0012-365X(97)00041-1_BIB5","unstructured":"S. Poljak, Zs. Tuza, The max cut problem \u2014 a survey, in: W. Cook, L. Lov\u00e1sz, P.D. Seymour (Eds.), DIMACS Series in Discrete Mathematics, AMS Press, Providence, RI, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000411?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000411?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:29:05Z","timestamp":1556396945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0012365X97000411"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00041-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}