Robertson-Seymour theorem

English

Etymology

Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.

Proper noun

the Robertson-Seymour theorem

  1. (graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.