The Depth-First Search Tree Structure of TKℵ0-Free Graphs

We characterize the graphs containing no subdivided infinite complete graph, by their normal, or depth-first search, tree structure. This implies the recent result of Robertson, Seymour and Thomas that these are precisely the graphs of finite tree-width.