{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:00:48Z","timestamp":1740110448593,"version":"3.37.3"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.amc.2019.05.020","type":"journal-article","created":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:06:11Z","timestamp":1558991171000},"page":"13-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A note on Tur\u00e1n\u2019s theorem"],"prefix":"10.1016","volume":"361","author":[{"given":"Long-Tu","family":"Yuan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.amc.2019.05.020_bib0001","first-page":"808","article-title":"Tur\u00e1n\u2019s graph theorem","volume":"102","author":"Aigner","year":"1995","journal-title":"Am. Math. Mon."},{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/j.amc.2019.05.020_bib0002"},{"key":"10.1016\/j.amc.2019.05.020_bib0003","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF01895726","article-title":"Extensions of Tur\u00e1n\u2019s theorem on graphs","volume":"14","author":"Dirac","year":"1963","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.amc.2019.05.020_bib0004","doi-asserted-by":"crossref","first-page":"290","DOI":"10.21136\/CPM.1969.108598","article-title":"On the number of complete subgraphs and circuits contained in graphs","volume":"94","author":"Erd\u00f6s","year":"1969","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"10.1016\/j.amc.2019.05.020_sbref0005","first-page":"249","article-title":"On the graph theory of Tur\u00e1n","volume":"21","author":"Erd\u00f6s","year":"1970","journal-title":"Math. Fiz. Lapok"},{"issue":"3","key":"10.1016\/j.amc.2019.05.020_bib0006","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(92)90323-8","article-title":"Bounds on the number of complete subgraphs","volume":"103","author":"Fischer","year":"1992","journal-title":"Discret. Math."},{"key":"10.1016\/j.amc.2019.05.020_sbref0007","first-page":"228","article-title":"A new proof of a theorem of Tur\u00e1n and some remarks on a generalization of it","volume":"15","author":"Katona","year":"1964","journal-title":"Mat. Lapok"},{"issue":"1\u20133","key":"10.1016\/j.amc.2019.05.020_bib0008","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","article-title":"Stable sets and polynomials. Graphs and combinatorics (Qawra, 1990)","volume":"124","author":"Lov\u00e1sz","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2019.05.020_bib0009","first-page":"283","article-title":"On a problem of Tur\u00e1n","volume":"7","author":"Moon","year":"1962","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/j.amc.2019.05.020_sbref0010","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok."},{"key":"10.1016\/j.amc.2019.05.020_bib0011","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00373-007-0738-8","article-title":"On the maximum number of cliques in a graph","volume":"23","author":"Wood","year":"2007","journal-title":"Graphs Comb."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T08:34:39Z","timestamp":1620808479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300319304138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":11,"alternative-id":["S0096300319304138"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.020","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on Tur\u00e1n\u2019s theorem","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}