3 papers
math.CO2025
Beyond the Pseudoforest Strong Nine Dragon Tree Theorem
Sebastian Mies, Benjamin Moore, Evelyne Smith-Roberge
The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph has maximum average degree …
math.CO2024
An Approximate Version of the Strong Nine Dragon Tree Conjecture
Sebastian Mies, Benjamin Moore
We prove the Strong Nine Dragon Tree Conjecture is true if we replace the edge bound with $d + \big\lceil k \big\lfloor\frac{d-1}{k+1}\big\rfloor \big(\frac{d}{k+1} - \frac{1}{2} \…
math.CO2024
The Strong Nine Dragon Tree Conjecture is True for
Sebastian Mies, Benjamin Moore
The arboricity of an undirected graph is the minimal number such that can be partitioned into forests on . Nash-Williams' formula states that $k =…