当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2020-07-14 , DOI: 10.1016/j.jctb.2020.07.001 Logan Grout , Benjamin Moore
中文翻译:
强九龙树猜想的伪森林类似物是真实的
更新日期:2020-07-14
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2020-07-14 , DOI: 10.1016/j.jctb.2020.07.001 Logan Grout , Benjamin Moore
We prove that for any positive integers k and d, if a graph G has maximum average degree at most , then G decomposes into pseudoforests so that for at least one of the pseudoforests, each connected component has at most d edges.
中文翻译:
强九龙树猜想的伪森林类似物是真实的
我们证明对于任何正整数k和d,如果图G最多具有最大平均度,然后G分解成 假林 因此对于至少一个伪林,每个连接的组件最多具有d个边。