Robertson–Seymour theorem
ID: robertson-seymour-theorem
The Robertson–Seymour theorem, a significant result in graph theory, is a foundational result in the study of graph minors. Formulated by Neil Robertson and Paul D. Seymour in a groundbreaking series of papers from the late 20th century, the theorem states that: **Any minor-closed family of graphs can be characterized by a finite set of forbidden minors.
New to topics? Read the docs here!