乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:11:41Z","timestamp":1720051901881},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12161141006"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1016\/j.dam.2024.01.003","type":"journal-article","created":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T00:56:55Z","timestamp":1705971415000},"page":"263-270","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Extremal numbers for disjoint copies of a clique"],"prefix":"10.1016","volume":"347","author":[{"given":"Junxue","family":"Zhang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2024.01.003_b1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jctb.1994.1032","article-title":"Equitable colouring of trees","volume":"61","author":"Chen","year":"1994","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/j.dam.2024.01.003_b2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/eujc.1994.1047","article-title":"Equitable coloring and the maximum degree","volume":"15","author":"Chen","year":"1994","journal-title":"European J. Combin."},{"issue":"3","key":"10.1016\/j.dam.2024.01.003_b3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00373-022-02467-1","article-title":"Extremal graphs for two vertex-disjoint copies of a clique","volume":"38","author":"Chen","year":"2022","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2024.01.003_b4","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BF01650069","article-title":"\u00dcber ein ExtremalProblem in der graphentheorie","volume":"13","author":"Erd\u0151s","year":"1962","journal-title":"Arch. Math."},{"key":"10.1016\/j.dam.2024.01.003_b5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/j.dam.2024.01.003_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113710","article-title":"Generalized Tur\u00e1n results for intersecting cliques","volume":"347","author":"Gerbner","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2024.01.003_b7","series-title":"Combinatorial Theory and its Applications, Vol. 2","first-page":"601","article-title":"Proof of a conjecture of Erd\u0151s[P]","volume":"vol. 4","author":"Hajnal","year":"1970"},{"key":"10.1016\/j.dam.2024.01.003_b8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2024.01.003_b9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.20630","article-title":"Every 4-colourable graph with maximum degree 4 has an equitable 4-colouring","volume":"71","author":"Kierstead","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2024.01.003_b10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","article-title":"A fast algorithm for equitable colouring","volume":"30","author":"Kierstead","year":"2010","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2024.01.003_b11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(94)00092-W","article-title":"On equitably colouring of bipartite graphs","volume":"151","author":"Lih","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2024.01.003_b12","series-title":"The generalized Tur\u00e1n problem of two intersecting cliques","author":"Liu","year":"2021"},{"key":"10.1016\/j.dam.2024.01.003_b13","series-title":"Problem 28, Wiskundige Opgaven, Vol. 10","first-page":"60","author":"Mantel","year":"1907"},{"key":"10.1016\/j.dam.2024.01.003_b14","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1080\/00029890.1973.11993408","article-title":"Equitable coloring","volume":"80","author":"Meyer","year":"1973","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.dam.2024.01.003_b15","unstructured":"J.W. Moon, On independent complete subgraph in a graph, in: International Congress of Mathematicians, Moscow, 1966, Abstracts 13. Section."},{"key":"10.1016\/j.dam.2024.01.003_b16","series-title":"Theory of Graphs","first-page":"279","article-title":"A method for solving extremal problems in extremal graph theory","author":"Simonovits","year":"1968"},{"key":"10.1016\/j.dam.2024.01.003_b17","first-page":"436","article-title":"On an extremal problem in graph theory (in Hungarian)","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/j.dam.2024.01.003_b18","series-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"10.1016\/j.dam.2024.01.003_b19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s00373-022-02518-7","article-title":"On generalized Tur\u00e1n number of two disjoint cliques","volume":"38","author":"Yuan","year":"2022","journal-title":"Graphs Combin."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24000143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24000143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T04:48:40Z","timestamp":1708577320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X24000143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":19,"alternative-id":["S0166218X24000143"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2024.01.003","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extremal numbers for disjoint copies of a clique","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2024.01.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}