{"title":"图的树分解","authors":"R. Yuster","doi":"10.1002/(SICI)1098-2418(199805)12:3%3C237::AID-RSA2%3E3.0.CO;2-W","DOIUrl":null,"url":null,"abstract":"Let H be a tree on h≥2 vertices. It is shown that if G=(V, E) is a graph with \\delta (G)\\ge (|V|/2)+10h^4\\sqrt{|V|\\log|V|}, and h−1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 237–251, 1998","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Tree decomposition of graphs\",\"authors\":\"R. Yuster\",\"doi\":\"10.1002/(SICI)1098-2418(199805)12:3%3C237::AID-RSA2%3E3.0.CO;2-W\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let H be a tree on h≥2 vertices. It is shown that if G=(V, E) is a graph with \\\\delta (G)\\\\ge (|V|/2)+10h^4\\\\sqrt{|V|\\\\log|V|}, and h−1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 237–251, 1998\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199805)12:3%3C237::AID-RSA2%3E3.0.CO;2-W\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199805)12:3%3C237::AID-RSA2%3E3.0.CO;2-W","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Tree decomposition of graphs
Let H be a tree on h≥2 vertices. It is shown that if G=(V, E) is a graph with \delta (G)\ge (|V|/2)+10h^4\sqrt{|V|\log|V|}, and h−1 divides |E|, then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 237–251, 1998
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
