Construct · 1 fields · 1 citations

excluded grid theorem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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

Graph algorithms

the result that graphs of large treewidth contain a large grid minor, so excluding a planar graph as a minor bounds treewidth.

In graph algorithms, excluded grid theorem refers to the result that graphs of large treewidth contain a large grid minor, so excluding a planar graph as a minor bounds treewidth. This meaning comes from Robertson (1986) in Journal of Combinatorial Theory, Series B.[1]

Unit
Recovery means
Measured by

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

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

Open in Collider Export BibTeX Report this entry

Nearby constructs

grid4 fields · 4 citationsjingle · one word, four constructs minor3 fields · 3 citationsjingle · one word, three carriers series3 fields · 3 citationsjingle · one word, three constructs

References

Robertson, N., & Seymour, P. D. (1986). Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41(1), 92-114. https://doi.org/10.1016/0095-8956(86)90030-4

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