English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The arboricity $\Gamma(G)$ of an undirected graph $G = (V,E)$ is the minimalnumber such that $E$ can be partitioned into $\Gamma(G)$ forests.Nash-Williams' formula states that $k = \lceil \gamma(G) \rceil$, where$\gamma(G)$ is the maximum of ${|E_H|}/(|V_H| -1)$ over all subgraphs $(V_H,E_H)$ of $G$ with $|V_H| \geq 2$.  The Strong Nine Dragon Tree Conjecture states that if $\gamma(G) \leq k +\frac{d}{d+k+1}$ for $k, d \in \mathbb N_0$, then there is a partition of theedge set of $G$ into $k+1$ forests such that one forest has at most $d$ edgesin each connected component.  We settle the conjecture for $d \leq k + 1$. For $d \leq 2(k+1)$, we cannotprove the conjecture, however we show that there exists a partition in whichthe connected components in one forest have at most $d + \lceil k \cdot\frac{d}{k+1} \rceil - k$ edges.  As an application of this theorem, we show that every $5$-edge-connectedplanar graph $G$ has a $\frac{5}{6}$-thin spanning tree. This theorem is bestpossible, in the sense that we cannot replace $5$-edge-connected with$4$-edge-connected, even if we replace $\frac{5}{6}$ with any positive realnumber less than $1$. This strengthens a result of Merker and Postle whichshowed $6$-edge-connected planar graphs have a $\frac{18}{19}$-thin spanningtree.

The Strong Nine Dragon Tree Conjecture is true for $d \leq k+1$