OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Robertson–Seymour theorem

 Home Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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.

 Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook