{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T07:11:27Z","timestamp":1772521887364,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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":[[1997,12]]},"DOI":"10.1016\/s0012-365x(97)00004-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"267-271","source":"Crossref","is-referenced-by-count":26,"title":["The size of the largest bipartite subgraphs"],"prefix":"10.1016","volume":"177","author":[{"given":"Paul","family":"Erd\u0151s","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00004-6_BIB1","doi-asserted-by":"crossref","unstructured":"N. Alon, Bipartite subgraphs, Combinatorica, to appear; manuscript of 1995.","DOI":"10.1007\/BF01261315"},{"key":"10.1016\/S0012-365X(97)00004-6_BIB2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","article-title":"Some extremal properties of bipartite subgraphs","volume":"25","author":"Edwards","year":"1973","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(97)00004-6_BIB3","series-title":"lecture at the 26th Southeastern Internat. Conf. on Graph Theory, Combinatorics, and Computing","article-title":"Some recent problems in combinatorics and graph theory","author":"Erd\u0151s","year":"1995"},{"key":"10.1016\/S0012-365X(97)00004-6_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02760037","article-title":"On some extremal problems in graph theory","volume":"3","author":"Erd\u0151s","year":"1965","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(97)00004-6_BIB5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0021-9800(68)80051-1","article-title":"On coloring graphs to maximize the proportion of multicolored k-edges","volume":"5","author":"Erd\u0151s","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00004-6_BIB6","unstructured":"T. Hofmeister, H. Lefmann, On k-partite subgraphs, Ars Combinatoria, to appear; manuscript of 1995."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:47:39Z","timestamp":1579020459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0012365X97000046"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00004-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}