A unifying framework for Graph Minor Structure Theorems with polynomial boundsResearch Paper
The Graph Minor Structure Theorem of Robertson and Seymour describes every graph that excludes a fixed graph as a minor: around any large grid-like piece, after deleting a bounded number of apex vertices, the graph is drawn in a surface in which does not embed, up to a bounded number of vortices of bounded depth. Its local form, the Local Structure…