{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:25:57Z","timestamp":1767245157720,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9987845","DMS-0106589"],"award-info":[{"award-number":["CCR-9987845","DMS-0106589"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004846","name":"State of New Jersey Department of State","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004846","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0095-8956(03)00075-3","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T11:02:03Z","timestamp":1058353323000},"page":"41-53","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the number of edges not covered by monochromatic copies of a fixed graph"],"prefix":"10.1016","volume":"90","author":[{"given":"Peter","family":"Keevash","sequence":"first","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1998","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/S0095-8956(03)00075-3_BIB1"},{"key":"10.1016\/S0095-8956(03)00075-3_BIB2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(96)00044-1","article-title":"Some recent problems and results in graph theory","volume":"164","author":"Erd\u0151s","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00075-3_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0012-365X(00)00312-5","article-title":"Edge disjoint monochromatic triangles in 2-colored graphs","volume":"231","author":"Erd\u0151s","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00075-3_BIB4","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Erd\u0151s","year":"1946","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0095-8956(03)00075-3_BIB5","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1080\/00029890.1959.11989408","article-title":"On sets of acquaintances and strangers at any party","volume":"66","author":"Goodman","year":"1959","journal-title":"Amer. Math. Monthly"},{"year":"1990","series-title":"Ramsey Theory","author":"Graham","key":"10.1016\/S0095-8956(03)00075-3_BIB6"},{"key":"10.1016\/S0095-8956(03)00075-3_BIB7","unstructured":"P. Keevash, B. Sudakov, Packing triangles in a graph and its complement, submitted."},{"year":"1993","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","key":"10.1016\/S0095-8956(03)00075-3_BIB8"},{"issue":"4","key":"10.1016\/S0095-8956(03)00075-3_BIB9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02579265","article-title":"Clique covering of graphs","volume":"6","author":"Pyber","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00075-3_BIB10","unstructured":"M. Simonovits, A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs, Proc. Colloq. Tihany, 1966, Academic Press, New York, and Akad. Kiad\u00f3, Budapest, 1968, pp. 279\u2013319."},{"issue":"1","key":"10.1016\/S0095-8956(03)00075-3_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01196136","article-title":"Graph products and monochromatic multiplicities","volume":"17","author":"Thomason","year":"1997","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:00:48Z","timestamp":1758816048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0095895603000753"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00075-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the number of edges not covered by monochromatic copies of a fixed graph","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0095-8956(03)00075-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}