{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:17:51Z","timestamp":1720052271147},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1016\/j.dam.2022.10.001","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T21:30:44Z","timestamp":1667943044000},"page":"108-119","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Saturation numbers for t<\/mml:mi>P<\/mml:mi><\/mml:mrow>k<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> with k<\/mml:mi><\/mml:math> less than 6"],"prefix":"10.1016","volume":"325","author":[{"given":"Shujuan","family":"Cao","sequence":"first","affiliation":[]},{"given":"Hui","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Xiaopan","family":"Lian","sequence":"additional","affiliation":[]},{"given":"Shunyu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Junxue","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2022.10.001_b1","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."},{"key":"10.1016\/j.dam.2022.10.001_b2","first-page":"29","article-title":"Results and problems on saturation numbers for linear forests","volume":"75","author":"Chen","year":"2015","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.dam.2022.10.001_b3","article-title":"A survey of minimum saturated graphs","volume":"#DS19","author":"Currie","year":"2021","journal-title":"Electron. J. Combin."},{"issue":"71","key":"10.1016\/j.dam.2022.10.001_b4","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","article-title":"A problem in graph theory","volume":"Monthly","author":"Erd\u0151s","year":"1964","journal-title":"Amer. Math."},{"key":"10.1016\/j.dam.2022.10.001_b5","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.dam.2022.10.001_b6","series-title":"50 Years of Combinatorics, Graph Theory, and Computing","article-title":"Developments on saturated graphs","author":"Gould","year":"2019"},{"key":"10.1016\/j.dam.2022.10.001_b7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190100209","article-title":"Saturated graphs with minimal number of edges","volume":"10","author":"K\u00e1szonyi","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2022.10.001_b8","series-title":"Saturation Spectrum for Trees","author":"Thomas","year":"2016"},{"key":"10.1016\/j.dam.2022.10.001_b9","first-page":"436","article-title":"Eine extremalaufgabe aus der graphentheorie","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/j.dam.2022.10.001_b10","series-title":"Introduction To Graph Theory","author":"West","year":"2001"},{"issue":"2","key":"10.1016\/j.dam.2022.10.001_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 Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X22003821?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X22003821?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T18:38:38Z","timestamp":1711564718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X22003821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":11,"alternative-id":["S0166218X22003821"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2022.10.001","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Saturation numbers for with less than 6","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2022.10.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}