{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:08:38Z","timestamp":1772291318493,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00115-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"39-58","source":"Crossref","is-referenced-by-count":13,"title":["Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdo\u030bs inequality"],"prefix":"10.1016","volume":"194","author":[{"given":"Stanislaw","family":"Bylka","sequence":"first","affiliation":[]},{"given":"Adam","family":"Idzik","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00115-0_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(98)00115-0_BIB2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/jgt.3190100407","article-title":"Largest bipartite subgraphs in triangle free graphs with maximum degree three","volume":"10","author":"Bondy","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(92)90126-G","article-title":"A linear time algorithm for graph partition problems","volume":"42","author":"Clark","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(98)00115-0_BIB4","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","article-title":"Laplacian eigenvalues and the maximum cut problem","volume":"62","author":"Delorme","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB5","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\/S0012-365X(98)00115-0_BIB6","series-title":"Recent Advances in Graph Theory, Proc. Prague Symp.","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(98)00115-0_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02760037","article-title":"On some extremal problems in graph theory","volume":"3","author":"Erd\u00f6s","year":"1965","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(98)00115-0_BIB8","first-page":"283","article-title":"On even subgraphs of graphs","volume":"18","author":"Erd\u00f6s","year":"1967","journal-title":"Mat. Lapok"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB9","series-title":"Recent Advances in Graph Theory","first-page":"189","article-title":"Problems and results on finite and infinite graphs","author":"Erd\u00f6s","year":"1975"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB10","series-title":"Graph Theory and Related Topics, Proc. Conf.","first-page":"153","article-title":"Problems and results in graph theory and combinatorial analysis","author":"Erd\u00f6s","year":"1979"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB11","series-title":"Proc. 26th ACM Symp. on the Theory of Computing","first-page":"422","article-title":"0.878 aproximation algorithm for MAX-CUT and MAX-2-SAT","author":"Goemans","year":"1994"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB12","series-title":"Progress in Graph Theory","first-page":"295","article-title":"On the minimal cut problem","author":"Goldberg","year":"1986"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB13","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibitity among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(82)90040-1","article-title":"Triangle-free partial graphs and edge covering theorems","volume":"39","author":"Lehel","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00115-0_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.3190060206","article-title":"Maximum k-colorable subgraphs","volume":"6","author":"Locke","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1017\/S0963548300000596","article-title":"Linear-time approximation algorithms for the Max Cut problem","volume":"2","author":"Ngoc","year":"1993","journal-title":"Combin. Probab. Computing"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB17","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. Discr. Math."},{"key":"10.1016\/S0012-365X(98)00115-0_BIB18","first-page":"181","article-title":"Maximum cuts and largest bipartite subgraphs","volume":"vol. 20","author":"Poljak","year":"1995"},{"key":"10.1016\/S0012-365X(98)00115-0_BIB19","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 Struct. Algorithms"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001150?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:24:03Z","timestamp":1556666643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98001150"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00115-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}