This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Excluded minor theory | |
|---|---|
| Name | Excluded minor theory |
| Field | Graph theory |
| Introduced | 20th century |
| Notable contributors | Paul Erdős; W. T. Tutte; Neil Robertson; Paul D. Seymour; Robin Thomas |
Excluded minor theory is a branch of graph theory and combinatorics that studies hereditary graph families characterized by a finite or infinite set of forbidden minors. It connects structural results about graphs with algorithmic consequences and deep theorems that unify work by multiple researchers and institutions. The theory has influenced results in topology, matroid theory, and theoretical computer science through interactions with major problems and frameworks.
Excluded minor theory grew from foundational work in Graph theory and Matroid theory and is closely associated with the Graph minor theorem program. Early contributors include W. T. Tutte and Paul Erdős, and later breakthroughs were achieved by researchers affiliated with Princeton University, University of Waterloo, and Microsoft Research. The framework links canonical objects such as the Kuratoswki's theorem-style obstructions, structural decompositions, and well-quasi-ordering results exemplified by the Robertson–Seymour theorem.
The historical arc traces from planar graph characterizations like Kuratowski's theorem and Wagner's theorem through Tutte's work on connectivity and Matroid theory in the mid-20th century. A major milestone was the Robertson–Seymour theorem proving that graphs are well-quasi-ordered under the minor relation; this result subsumes results by Kruskal and interfaces with the Well-quasi-ordering concept in combinatorics. Key contributors include Neil Robertson, Paul D. Seymour, Robin Thomas, and institutions such as Bell Labs and Bellcore where foundational combinatorial optimization work occurred. Subsequent theorems address structure: the Excluded grid theorem (Robertson and Seymour), along with decomposition theorems that parallel work by Tutte and by researchers at MIT and Stanford University.
The framework formalizes minors via contraction and deletion operations first studied in classical texts like those by W. T. Tutte and later codified by the Robertson–Seymour series. For a graph class closed under taking minors, an excluded-minor characterization identifies the minimal forbidden minors analogous to the pair Kuratowski's theorem forbidding K5 and K3,3. The interplay of minors with connectivity notions, such as those studied by Menger and Whitney, and with embedding results related to Heawood and Euler, is central to structural descriptions. Major techniques draw on tree-decompositions and branch-width, areas advanced at institutions like IBM Research and by authors affiliated with Cornell University and ETH Zurich.
Classical examples include planar graphs (forbidden K5 and K3,3), outerplanar graphs, series-parallel graphs (forbidden K4), and apex graphs studied by groups at UC Berkeley and University of Cambridge. More intricate classes arise in the characterization of graphs excluding a fixed minor such as K6 or the Petersen graph; these classifications often involve structure theorems proved by teams including Robertson, Seymour, and Thomas with collaborations across Princeton and Caltech. In matroid contexts, representability over fields like GF(2) or GF(3) yields excluded-minor characterizations developed by researchers at University of Waterloo and Ohio State University.
Excluded-minor characterizations underpin fixed-parameter tractable algorithms and polynomial-time solvability results tied to graph parameters like treewidth and branch-width studied by groups at Carnegie Mellon University and EPFL. The Graph minor theorem implies decidability of many properties expressible in monadic second-order logic via techniques associated with Courcelle and collaborators at INRIA and CNRS. Complexity separations leverage excluded minors to design kernelization and approximation schemes, drawing on work by researchers at University of Toronto and ETH Zurich.
Excluded minor ideas extend naturally to Matroid theory where representability and excluded-minor lists characterize classes such as regular matroids (Tutte), graphic matroids, and binary matroids studied by John Tutte and later by teams at University of Illinois and Rutgers University. Beyond matroids, analogous obstruction sets appear in topological graph theory relating to embeddings in surfaces studied at University of Warwick and in constraint satisfaction frameworks developed at Bell Labs and Microsoft Research.
Active research targets finite versus infinite excluded-minor lists for specific properties, algorithmic extraction of obstruction sets, and tight bounds in the excluded grid theorem; research groups at Princeton University, University of California, San Diego, University of Cambridge, and Carnegie Mellon University publish frequently in these areas. Other directions involve connections with parameterized complexity pioneered by Downey and Fellows, structural refinement for large excluded minors pursued at MIT and Harvard University, and generalizations to infinite graphs and matroids explored at University of Oxford and Imperial College London.