{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:36:12Z","timestamp":1648690572879},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Korea University Grant"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00373-021-02290-0","type":"journal-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T13:03:28Z","timestamp":1615381408000},"page":"919-932","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Lower and Upper Bounds of Tur\u00e1n Number for Odd Wheels"],"prefix":"10.1007","volume":"37","author":[{"given":"Byeong Moon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Chul","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Woonjae","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,10]]},"reference":[{"issue":"1","key":"2290_CR1","first-page":"21","volume":"68","author":"H Bielak","year":"2014","unstructured":"Bielak, H., Kieliszek, S.: The Tur\u00e1n number of the graph $$3P_4$$. Ann. Univ. Mariae Curie SkLodowska Sect. A 68(1), 21\u201329 (2014)","journal-title":"Ann. Univ. Mariae Curie SkLodowska Sect. A"},{"key":"2290_CR2","doi-asserted-by":"publisher","first-page":"683","DOI":"10.7151\/dmgt.1883","volume":"36","author":"H Bielak","year":"2016","unstructured":"Bielak, H., Kieliszek, S.: The Tur\u00e1n number of the graph $$2P_5$$. Discuss. Math. Graph Theory 36, 683\u2013694 (2016)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2290_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1017\/S0963548311000460","volume":"20","author":"N Bushaw","year":"2011","unstructured":"Bushaw, N., Kettle, N.: Tur\u00e1n numbers of multiple paths and equibipartite forests. Combin. Probab. Comput. 20, 837\u2013853 (2011)","journal-title":"Combin. Probab. Comput."},{"issue":"5","key":"2290_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1007\/s00373-012-1212-9","volume":"29","author":"T Dzido","year":"2013","unstructured":"Dzido, T.: A note on Tur\u00e1n numbers for even wheels. Graphs Combin. 29(5), 1305\u20131309 (2013)","journal-title":"Graphs Combin."},{"issue":"4","key":"2290_CR5","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.disc.2017.10.003","volume":"341","author":"T Dzido","year":"2018","unstructured":"Dzido, T., Jastrz\u0229bski, A.: Tur\u00e1n numbers for odd wheels. Discrete Math. 341(4), 1150\u20131154 (2018)","journal-title":"Discrete Math."},{"issue":"3","key":"2290_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P Erd\u00f6s","year":"1982","unstructured":"Erd\u00f6s, P., Simonovitz, M.: Compactness results in extremal graph theory. Combinatorica 2(3), 275\u2013288 (1982)","journal-title":"Combinatorica"},{"key":"2290_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","volume":"27","author":"I Gorgol","year":"2011","unstructured":"Gorgol, I.: Tur\u00e1n numbers for disjoint copies of graphs. Graphs Combin. 27, 661\u2013667 (2011)","journal-title":"Graphs Combin."},{"issue":"11","key":"2290_CR8","doi-asserted-by":"publisher","first-page":"3687","DOI":"10.1090\/S0002-9939-2012-11274-2","volume":"140","author":"O Pikhurko","year":"2012","unstructured":"Pikhurko, O.: A note on the Tur\u00e1n function of even cycles. Proc. Am. Math. Soc. 140(11), 3687\u20133692 (2012)","journal-title":"Proc. Am. Math. Soc."},{"key":"2290_CR9","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"2290_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","volume":"340","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Zhang, X.: The Tur\u00e1n number of disjoint copies. Discrete Math. 340, 132\u2013139 (2017)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02290-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02290-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02290-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T14:41:39Z","timestamp":1619448099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02290-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2290"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02290-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,10]]},"assertion":[{"value":"25 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}