2 problems

Extremal graph conjecture for unions of cliques. Suppose $2\leqslant p\leqslant q$, $n>(t-1)(q+1)^2+3(p-2)$ and $t\geqslant 4$. Then $H(n;p,q,\ldots,q)$ is the unique extremal grap…

Let $T$ be a tree, let $\operatorname{emin}(T)=\delta$ denote the minimum degree parameter used in the paper, and let $C$ be the maximum distance from any given vertex of $T$ to th…