{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T23:03:06Z","timestamp":1773442986962,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(03)00036-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T02:16:19Z","timestamp":1051236979000},"page":"329-346","source":"Crossref","is-referenced-by-count":58,"title":["Maximum cuts and judicious partitions in graphs without short cycles"],"prefix":"10.1016","volume":"88","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00036-4_BIB1","doi-asserted-by":"crossref","unstructured":"N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electronic J. Combin. 1 (1994) R12, 8pp.","DOI":"10.1002\/jgt.3190180406"},{"key":"10.1016\/S0095-8956(03)00036-4_BIB2","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\/S0095-8956(03)00036-4_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(97)00041-1","article-title":"Bipartite subgraphs of integer weighted graphs","volume":"181","author":"Alon","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB4","unstructured":"N. Alon, M. Krivelevich, B. Sudakov, Tur\u00e1n numbers of bipartite graphs and related Ramsey type questions, submitted for publication."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB5","series-title":"The Probabilistic Method","author":"Alon","year":"2000"},{"key":"10.1016\/S0095-8956(03)00036-4_BIB6","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1112\/plms\/83.3.532","article-title":"The difference between consecutive primes II","volume":"83","author":"Baker","year":"2001","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB7","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s004939970002","article-title":"Exact bounds for judicious partitions of graphs","volume":"19","author":"Bollob\u00e1s","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00036-4_BIB8","unstructured":"B. Bollob\u00e1s, A.D. Scott, Better bounds for max cut, in: B. Bollob\u00e1s (Ed.), Contemporary Combinatorics, Bolyai Society Mathematical Studies, Springer, Berlin, 2002, pp. 185\u2013246."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","article-title":"Cycles of even length in graphs","volume":"16","author":"Bondy","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00036-4_BIB10","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":"Canad. J. Math."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB11","unstructured":"C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, Proceedings of Second Czechoslovak Symposium on Graph Theory, Prague, 1975, pp. 167\u2013181."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB12","unstructured":"P. Erd\u0151s, Problems and results in graph theory and combinatorial analysis, in: Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), Academic Press, New York, 1979, pp. 153\u2013163."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB13","first-page":"215","article-title":"On a problem in the theory of graphs","volume":"7","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0095-8956(03)00036-4_BIB14","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\/S0095-8956(03)00036-4_BIB15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01285820","article-title":"On a bottleneck bipartition conjecture of Erd\u0151s","volume":"12","author":"Porter","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00036-4_BIB16","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"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:54:16Z","timestamp":1553205256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895603000364"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00036-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}