On the purity of minor-closed classes of graphs

Colin McDiarmid, Michał Przykucki

Given a graph $H$ with at least one edge, let ${\mathrm{gap}}_H(n)$ denote the maximum difference between the numbers of edges in two $n$-vertex edge-maximal graphs with no m…