Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Roberge, Evelyne Smith"'
The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph $G$ has maximum average degree $\text{mad}(G) = 2 \max_{H \subseteq G} \frac{e(G)}{v(G)}$ at most $2(k + \frac{d}{k+d+1})$, then it has a decomposition into $k+
Externí odkaz:
http://arxiv.org/abs/2310.00931
