Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

Guillaume Chapuy, Guillem Perarnau

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a…