5 problems

Bollobás's conjecture. Then $T\subset G$.

Havet–Reed–Stein–Wood conjecture. If

Besomi–Pavez-Signé–Stein conjecture. If

Klimošová–Piguet–Rozhoň conjecture. If

Let $k$ be a positive integer, and let $G$ be a graph with minimum degree $delta(G)\ge \lfloor 2k/3\rfloor$ and maximum degree $Delta(G)\ge k$. A $k$-edge tree is a tree with exact…