Robertson-Seymour minor theorem

Layer 0 — Mathematicsin the graph-theory subtree

Graph minors form well-quasi-order: any infinite family contains H ≤ G. Polynomial recognition for every minor-closed class.

Related concepts

Explore Robertson-Seymour minor theorem on the interactive knowledge graph →