Given a graph $G$ with $n$ vertices, let $\lambda_1$ be the largest eigenvalue of the adjacency matrix. What is the lower bound for $\lambda_1$ in terms of the average degree $d_{avg}$?