{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:45Z","timestamp":1740107145841,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T00:00:00Z","timestamp":1536192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["429383"],"award-info":[{"award-number":["429383"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1941-5","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T02:00:52Z","timestamp":1536199252000},"page":"1519-1537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extremal Threshold Graphs for Matchings and Independent Sets"],"prefix":"10.1007","volume":"34","author":[{"given":"L.","family":"Keough","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Radcliffe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"issue":"1\u20132","key":"1941_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R Ahlswede","year":"1978","unstructured":"Ahlswede, R., Katona, G.O.H.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hung. 32(1\u20132), 97\u2013120 (1978)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1941_CR2","unstructured":"Chvatal, V., Hammer, P.L.: Set-packing problems and threshold graphs, Tech. Report CORR 73-21, University of Waterloo (1973)"},{"issue":"1","key":"1941_CR3","doi-asserted-by":"crossref","first-page":"P169","DOI":"10.37236\/656","volume":"18","author":"J Cutler","year":"2011","unstructured":"Cutler, J., Radcliffe, A.J.: Extremal problems for independent set enumeration. Electron. J. Comb. 18(1), P169 (2011)","journal-title":"Electron. J. Comb."},{"key":"1941_CR4","first-page":"187","volume-title":"A Theorem of Finite Sets, Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"G Katona","year":"1968","unstructured":"Katona, G.: A Theorem of Finite Sets, Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 187\u2013207. Academic Press, New York (1968)"},{"issue":"6","key":"1941_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00493-014-3188-y","volume":"36","author":"L Keough","year":"2016","unstructured":"Keough, L., Radcliffe, A.J.: Graphs with the fewest matchings. Combinatorica 36(6), 703\u2013723 (2016). https:\/\/doi.org\/10.1007\/s00493-014-3188-y","journal-title":"Combinatorica"},{"key":"1941_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"The Number of Simplices in a Complex. Mathematical Optimization Techniques","author":"JB Kruskal","year":"1963","unstructured":"Kruskal, J.B.: The Number of Simplices in a Complex. Mathematical Optimization Techniques, pp. 251\u2013278. University of California Press, Berkeley (1963)"},{"key":"1941_CR7","volume-title":"Threshold Graphs and Related Topics, Annals of Discrete Mathematics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, Annals of Discrete Mathematics, vol. 56. North-Holland Publishing Co., Amsterdam (1995)"},{"issue":"4","key":"1941_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<283::AID-JGT3>3.0.CO;2-H","volume":"31","author":"Uri N Peled","year":"1999","unstructured":"Peled, Uri N., Petreschi, Rossella, Sterbini, Andrea: $$(n, e)$$ ( n , e ) -graphs with maximum sum of squares of degrees. J. Graph Theory 31(4), 283\u2013295 (1999)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1941-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T20:29:04Z","timestamp":1661977744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1941-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,6]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1941"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1941-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,9,6]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}