4 problems

For positive integers $\Delta$ and $t$, let $h_t(\Delta)$ be the smallest integer such that every graph $G$ with at least $h_t(\Delta)$ edges and maximum degree…

For positive integers $\Delta$ and $t$, let $h_t(\Delta)$ be the smallest integer such that every graph $G$ with at least $h_t(\Delta)$ edges and maximum degree…

Asymptotic upper-bound conjecture. For $t\ne 2$ and any $\varepsilon>0$,

Cubic edge diameter conjecture.