{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:41:14Z","timestamp":1726472474900},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"NSF-GRFP","award":["DGE-1041000"]},{"name":"NSA","award":["H98230-16-1-0038"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1016\/j.disc.2017.09.016","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T03:30:53Z","timestamp":1507865453000},"page":"492-496","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tur\u00e1n numbers of vertex-disjoint cliques in r<\/mml:mi><\/mml:math>-partite graphs"],"prefix":"10.1016","volume":"341","author":[{"given":"Jessica","family":"De Silva","sequence":"first","affiliation":[]},{"given":"Kristin","family":"Heysse","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6844-894X","authenticated-orcid":false,"given":"Adam","family":"Kapilow","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Schenfisch","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Young","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2017.09.016_b1","first-page":"21","article-title":"The Tur\u00e1n number of the graph 3P4","volume":"68","author":"Bielak","year":"2014","journal-title":"Ann. Univ. Mariae Curie-Sklodowska Sect. A - Math."},{"issue":"3","key":"10.1016\/j.disc.2017.09.016_b2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.7151\/dmgt.1883","article-title":"The Tur\u00e1n number of the graph 2P5","volume":"36","author":"Bielak","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/j.disc.2017.09.016_b3"},{"key":"10.1016\/j.disc.2017.09.016_b4","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S0963548311000460","article-title":"Tur\u00e1n numbers of multiple paths and equibipartite forests","volume":"20","author":"Bushaw","year":"2011","journal-title":"Combin. Probab. Comput."},{"issue":"10","key":"10.1016\/j.disc.2017.09.016_b5","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.2017.09.016_b6","unstructured":"J. De\u00a0Silva, K. Heysse, M. Young, Rainbow number for matchings in r-partite graphs, preprint."},{"issue":"5","key":"10.1016\/j.disc.2017.09.016_b7","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","article-title":"Tur\u00e1n numbers for disjoint copies of graphs","volume":"27","author":"Gorgol","year":"2011","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2017.09.016_b8","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1016\/j.disc.2008.05.011","article-title":"Bipartite rainbow numbers of matchings","volume":"309","author":"Li","year":"2009","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.disc.2017.09.016_b9","first-page":"#P62","article-title":"On the Tur\u00e1n number of forests","volume":"20","author":"Lidick\u00fd","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2017.09.016_b10","unstructured":"L.-T. Yuan, X.-D. Zhang, Tur\u00e1n numbers for disjoint paths, arXiv:1611.00981."},{"issue":"2","key":"10.1016\/j.disc.2017.09.016_b11","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","article-title":"The Tur\u00e1n number of disjoint copies of paths","volume":"340","author":"Yuan","year":"2017","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X17303266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X17303266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:16:38Z","timestamp":1643674598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X17303266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["S0012365X17303266"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2017.09.016","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2018,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tur\u00e1n numbers of vertex-disjoint cliques in -partite graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2017.09.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}