New Proofs in Graph Minors
The theory of Graph Minors developed by Robertson and Seymour has had wide reaching consequences in graph theory and theoretical computer science. The main result of the theory, known as the graph minor structure theorem, approximately describes the structure of graphs which do not contain a fixed graph as a minor. The structure theorem is the central piece of many of the algorithmic applications of graph minor theory. Unfortunately, the statement of this structure theorem is quite complex and the only proof until now requires a series of 16 technical papers.