KnowraRobertson–Seymour theoremLinked fromLinked fromThe 4 pages that link to Robertson–Seymour theorem, each with the reason it gives.All 4Related 2Narrower topic 1Compared with 1Graph minorRelated: It turns minor containment into a finite characterization of graph families.Wagner's theoremNarrower topic: It generalizes the finite-obstruction pattern exemplified by Wagner’s theorem.Erdős–Pósa theoremRelated: Its structural theory became central to later generalizations of packing-covering results.Graph structure theoremCompared with: Its qualitative finiteness contrasts with the structural theorem’s detailed description of excluded-minor graphs.