{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T05:18:54Z","timestamp":1696396734200},"reference-count":0,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:00Z","timestamp":1490054400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271348","11671376"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2018,1]]},"abstract":"Abstract<\/jats:title>Let be the largest integer such that, for all graphs G<\/jats:italic> on n<\/jats:italic> vertices, the edge set can be partitioned into at most parts, of which every part either is a single edge or forms a graph isomorphic to H<\/jats:italic>. Pikhurko and Sousa conjectured that for and all sufficiently large n<\/jats:italic>, where denotes the maximum number of edges of graphs on n<\/jats:italic> vertices that do not contain H<\/jats:italic> as a subgraph. A \u2010fan is a graph on vertices consisting of k<\/jats:italic> cliques of order r<\/jats:italic> that intersect in exactly one common vertex. In this article, we verify Pikhurko and Sousa's conjecture for \u2010fans. The result also generalizes a result of Liu and Sousa.<\/jats:p>","DOI":"10.1002\/jgt.22139","type":"journal-article","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:43:00Z","timestamp":1490114580000},"page":"46-60","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition of Graphs into (k,r)\u2010Fans and Single Edges"],"prefix":"10.1002","volume":"87","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7634-0250","authenticated-orcid":false,"given":"Xinmin","family":"Hou","sequence":"first","affiliation":[{"name":"KEY LABORATORY OF WU WEN\u2010TSUN MATHEMATICS CHINESE ACADEMY OF SCIENCES SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI ANHUI 230026 CHINA"}]},{"given":"Yu","family":"Qiu","sequence":"additional","affiliation":[{"name":"KEY LABORATORY OF WU WEN\u2010TSUN MATHEMATICS CHINESE ACADEMY OF SCIENCES SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI ANHUI 230026 CHINA"}]},{"given":"Boyuan","family":"Liu","sequence":"additional","affiliation":[{"name":"KEY LABORATORY OF WU WEN\u2010TSUN MATHEMATICS CHINESE ACADEMY OF SCIENCES SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI ANHUI 230026 CHINA"}]}],"member":"311","published-online":{"date-parts":[[2017,3,21]]},"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22139","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T21:38:37Z","timestamp":1696369117000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1002\/jgt.22139"],"URL":"http:\/\/dx.doi.org\/10.1002\/jgt.22139","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,21]]}}}
