乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T12:42:03Z","timestamp":1694349723274},"reference-count":12,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12111540249","12161141006"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004945","name":"Nankai University","doi-asserted-by":"publisher","award":["63223063"],"id":[{"id":"10.13039\/501100004945","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin City","doi-asserted-by":"publisher","award":["20JCJQJC00090","20JCZDJC00840"],"id":[{"id":"10.13039\/501100006606","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":["Discrete Mathematics"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1016\/j.disc.2023.113530","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T16:44:27Z","timestamp":1685551467000},"page":"113530","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extremal numbers of disjoint triangles in r-partite graphs"],"prefix":"10.1016","volume":"346","author":[{"given":"Junxue","family":"Zhang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2023.113530_br0010","first-page":"343","article-title":"Complete subgraphs of chromatic graphs and hypergraphs","volume":"6","author":"Bollob\u00e1s","year":"1974","journal-title":"Util. Math."},{"key":"10.1016\/j.disc.2023.113530_br0020","doi-asserted-by":"crossref","first-page":"3370","DOI":"10.1016\/j.disc.2008.10.002","article-title":"Complete solution for the rainbow numbers of matchings","volume":"309","author":"Chen","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2023.113530_br0030","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.disc.2017.09.016","article-title":"Tur\u00e1n numbers of vertex-disjoint cliques in r-partite graphs","volume":"341","author":"De Silva","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2023.113530_br0040","unstructured":"J. De Silva, K. Heysse, M. Young, Rainbow number for matchings in r-partite graphs, preprint."},{"key":"10.1016\/j.disc.2023.113530_br0050","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BF01650069","article-title":"\u00dcber ein Extremalproblem in der Graphentheorie (German)","volume":"13","author":"Erd\u0151s","year":"1962","journal-title":"Arch. Math. (Basel)"},{"key":"10.1016\/j.disc.2023.113530_br0060","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. Hung."},{"key":"10.1016\/j.disc.2023.113530_br0070","article-title":"Tur\u00e1n number of disjoint triangles in 4-partite graphs","volume":"29","author":"Han","year":"2022","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2023.113530_br0080","first-page":"60","article-title":"Problem 28","volume":"vol. 10","author":"Mantel","year":"1907"},{"key":"10.1016\/j.disc.2023.113530_br0090","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4153\/CJM-1968-012-x","article-title":"On independent complete subgraphs in a graph","volume":"20","author":"Moon","year":"1968","journal-title":"Can. J. Math."},{"key":"10.1016\/j.disc.2023.113530_br0100","series-title":"Theory of Graphs, Proc. Colloq. Tihany","first-page":"279","article-title":"A method for solving extremal problems in graph theory","author":"Simonovits","year":"1966"},{"key":"10.1016\/j.disc.2023.113530_br0110","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.disc.2023.113530_br0120","series-title":"Introduction to Graph Theory","author":"West","year":"2001"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X23002169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X23002169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T02:50:35Z","timestamp":1694227835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X23002169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S0012365X23002169"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2023.113530","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extremal numbers of disjoint triangles in r-partite graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2023.113530","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"113530"}}