  We prove that a class of graphs with an excluded minor and with the maximum
degree sublinear in the number of edges is maximally modular, that is,
modularity tends to 1 as the number of edges tends to infinity.

Combinatorics