强九龙树猜想对 $$d \le k + 1$$

{"title":"强九龙树猜想对 $$d \\le k + 1$$","authors":"S. Mies, B. Moore","doi":"10.1007/s00493-023-00058-z","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Strong Nine Dragon Tree Conjecture is True for $$d \\\\le k + 1$$\",\"authors\":\"S. Mies, B. Moore\",\"doi\":\"10.1007/s00493-023-00058-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-023-00058-z\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00058-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}