Robertson and Seymour tell us that any minor-closed family of graphs has a finite collection of excluded minors. Standard examples include planar graphs with two excluded minors ( …

The theorem of Robertson-Seymour about graph minors says that there exists no infinite family of graphs such that none of them is a minor of another one. Apparently, it came as a …

For definitions of graph minors and topological minors, see wikipedia's article on graph minors. Theorem: For every graph H, there is a finite set of graphs, say S(H), such that G …