Universal diameter bounds for random graphs with given degrees

Louigi Addario-Berry, Gabriel Crudele

Given a graph $G$, let $\mathrm{diam}(G)$ be the greatest distance between any two vertices of $G$ which lie in the same connected component, and let ${\mathrm{diam}}^{+}(G)$ be the gr…