Excluding a countable clique

We extend the excluded $K_n$ minor theorem of Robertson and Seymour to infinite graphs, and deduce a structural characterization of the infinite graphs that have no $K_{\aleph_0}$~minor. The latter is a refinement of an earlier characterization of Robertson, Seymour and the second author.

Download (PDF)