1 problem

Let $D\in\mathbb{N}$. An $(n,d,\lambda)$-graph is a graph on $n$ vertices with degree $d$ and second eigenvalue bounded by $\lambda$. Let $T$ be a tree of maximum degree at most…