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 1 en graph theory A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering. en eponyms