Excluding a Countable Clique

We extend the excludedKnminor theorem of Robertson and Seymour to infinite graphs and deduce a structural characterization of the infinite graphs that have noKℵ0minor. The latter is a refinement of an earlier characterization of Robertson, Seymour, and the second author.