2 problems

Let $G$ be a finite, undirected, loopless simple graph, let $|G|$ denote its number of vertices, let $\Delta=\Delta(G)$ be its maximum degree, and let $\overline{d}(G)$ be its aver…

Average-degree tree-packing conjecture. If $G$ has average degree at least $k-1$, equivalently at least