Graph Structure Theorem

The graph structure theorem, in graph theory, describes how graphs excluding a fixed minor are built from simpler pieces embeddable on surfaces, connecting the theory of graph minors to topological embeddings. It appears as the seventeenth paper in a twenty-three paper series by Neil Robertson and Paul Seymour, and because the original proof is long and intricate, later surveys by Kawarabayashi and Mohar in 2007 and by Laszlo Lovasz in 2006 were written to make the theorem accessible beyond the small group of specialists who first worked through it. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/