{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:40Z","timestamp":1765164100128,"version":"3.46.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271169"],"award-info":[{"award-number":["12271169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"crossref","award":["22DZ2229014"],"award-info":[{"award-number":["22DZ2229014"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China grant","doi-asserted-by":"crossref","award":["12331014"],"award-info":[{"award-number":["12331014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02972-z","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:13:41Z","timestamp":1759774421000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proof of a conjecture of Xiao and Zamora"],"prefix":"10.1007","volume":"41","author":[{"given":"Wanfang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Changhong","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jia-Bao","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4602-5911","authenticated-orcid":false,"given":"Long-Tu","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"2972_CR1","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory, Theory of graphs and its applications, in: Proc. Sympos. Smolenice, 1964, pp. 29-36"},{"key":"2972_CR2","first-page":"34","volume":"16","author":"JW Moon","year":"1965","unstructured":"Moon, J.W.: On extremal graph containing no wheels. Acta Mathematical Hungerica. 16, 34\u201339 (1965)","journal-title":"Acta Mathematical Hungerica."},{"key":"2972_CR3","first-page":"107","volume":"8","author":"M Bataineh","year":"2015","unstructured":"Bataineh, M., Jaradat, M., Jaradat, A.: Edge maximal graphs containing no specific wheels. Jordan J. Math. Statist. 8, 107\u2013120 (2015)","journal-title":"Jordan J. Math. Statist."},{"key":"2972_CR4","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., Jastrzebski, A.: Tur\u00e1n numbers for odd wheels. Discrete Math. 341, 1150\u20131154 (2018)","journal-title":"Discrete Math."},{"key":"2972_CR5","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, 1305\u2013130 (2013)","journal-title":"Graphs Combin."},{"key":"2972_CR6","first-page":"77","volume":"1968","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P.: On some new inequalities concerning extremal properties of graphs, stability problems, theory graphs (proc. Colloq. Tihany 1968, 77\u201381 (1966)","journal-title":"Colloq. Tihany"},{"key":"2972_CR7","first-page":"279","volume-title":"A method for solving extremal problems in graph theory, Stability problems, Theory of Graphs","author":"M Simonovits","year":"1968","unstructured":"Simonovits, M.: A method for solving extremal problems in graph theory, Stability problems, Theory of Graphs, pp. 279\u2013319. Tihany), Proc. Colloq. (1968)"},{"key":"2972_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112570","volume":"344","author":"C Xiao","year":"2021","unstructured":"Xiao, C., Zamora, O.: A note on the tur\u00e1n number of disjoint union of wheels. Discrete Mathe. 344, 112570 (2021)","journal-title":"Discrete Mathe."},{"key":"2972_CR9","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1002\/jgt.22727","volume":"98","author":"L Yuan","year":"2021","unstructured":"Yuan, L.: Extremal graphs for odd wheels. J. Graph Theory. 98, 691\u2013707 (2021)","journal-title":"J. Graph Theory."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02972-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:38Z","timestamp":1765164038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02972-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2972"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02972-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"13 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"114"}}