{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T13:57:24Z","timestamp":1779199044744,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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,2]]},"DOI":"10.1016\/s0012-365x(98)00195-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"51-64","source":"Crossref","is-referenced-by-count":16,"title":["Two path extremal graphs and an application to a Ramsey-type problem"],"prefix":"10.1016","volume":"196","author":[{"given":"Owen D.","family":"Byer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00195-2_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01902206","article-title":"Graphs with maximal number of adjacent pairs of edges","volume":"32","author":"Ahlswede","year":"1978","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB2","series-title":"Extremal Graph Theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1977"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB4","article-title":"Several results on extremal (v, e)-graphs","author":"Byer","year":"1996"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB5","first-page":"459","article-title":"On the number of complete subgraphs contained in certain graphs","volume":"7","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0012-365X(98)00195-2_BIB6","series-title":"Recent Studies in Graph Theory","first-page":"159","article-title":"Extremal graphic sequences","author":"Kennedy","year":"1989"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0378-8733(81)90014-9","article-title":"The degree variance: an index of graph heterogeneity","volume":"3","author":"Snijders","year":"1981","journal-title":"Social Networks"},{"key":"10.1016\/S0012-365X(98)00195-2_BIB8","article-title":"Maximum value and null moments of the degree variance","author":"Snijders","year":"1981"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001952?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001952?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:55:25Z","timestamp":1556132125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98001952"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00195-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}