Construct · 1 fields · 1 citations

Robertson-Seymour theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Robertson-Seymourtheorem1 CONSTRUCTRobertson-SeymourROBERTSON · GRAPH THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the result that finite graphs are well-quasi-ordered under taking minors, so every minor-closed graph family is defined by finitely many forbidden minors.

In graph theory, Robertson-Seymour theorem refers to the result that finite graphs are well-quasi-ordered under taking minors, so every minor-closed graph family is defined by finitely many forbidden minors. This meaning comes from Robertson (2004) in Journal of Combinatorial Theory, Series B.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Robertson-Seymour theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

family3 fields · 3 citationsjingle · one word, three constructsseries3 fields · 3 citationsjingle · one word, three constructs

References

  1. Robertson, N., & Seymour, P. D. (2004). Graph Minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B, 92(2), 325-357. https://doi.org/10.1016/j.jctb.2004.08.001

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct