1 problem

Linear maximum degree conjecture. For any $t$ there exists a constant $c=c(t)$ such that every path-pairable graph on $n$ vertices without a $K_t$ minor must contain a vertex of de…