 Maximum degree

The maximum degree of a finite graph is the largest number of edges incident to one vertex. A bound $d$ on degree bounds the number of vertices within distance $k$ of a fixed vertex by $1+d+\cdots +d^k$. Such counting bounds turn a large vertex count into a lower bound on diameter.