Ringel-type conjecture for degenerate graphs

Fix an integer $D$. Degenerate-graph Ringel-type conjecture. There exists $n_0\in\mathbb{N}$ such that, for every $n\ge n_0$, if $G$ is a $D$-degenerate graph on $n$ vertices with $m\ge n-1$ edges, then $2m+1$ copies of $G$ pack into $K_{2m+1}$. The paper presents this as a possible analogue of Ringel's conjecture for degenerate graphs, but gives no resolution.