The Graph Minor Theorem
ثبت نشده
چکیده
2 Properties excluding a planar graph 3 2.1 Path-width and tree-width . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Excluding a forest . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Planar graphs and sleeve unions . . . . . . . . . . . . . . . . . . 10 2.4 Planar graphs and grids . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Families with bounded tree-width . . . . . . . . . . . . . . . . . . 15
منابع مشابه
The excluded minor structure theorem, and linkages in large graphs of bounded tree-width
At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove several versions of this theorem, each stressing some particular aspects needed at a corresponding stage of the proof of the main result of their theory, the ...
متن کاملThe Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application
In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...
متن کاملRecent Excluded Minor Theorems for Graphs
A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. An excluded minor theorem describes the structure of graphs with no minor isomorphic to a prescribed set of graphs. Splitter theorems are tools for proving excluded minor theorems. We discuss splitter theorems for internally 4-connected graphs and for cyclically 5-connected cubic graph...
متن کاملA Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
A key result of Robertson and Seymour’s graph minor theory is a structure theorem stating that all graphs excluding some fixed graph as a minor have a tree decomposition into pieces that are almost embeddable in a fixed surface. Most algorithmic applications of graph minor theory rely on an algorithmic version of this result. However, the known algorithms for computing such graph minor decompos...
متن کاملUnprovability threshold for planar graph minor theorem
This note is part of implementation of a programme in foundations of mathematics to find exact threshold versions of all mathematical unprovability results known so far, a programme initiated by A. Weiermann. Here we find the exact versions of unprovability of the finite graph minor theorem restricted to planar graphs, connected planar graphs and graphs embeddable into a given surface, assuming...
متن کاملGraph minors and graphs on surfaces
Graph minors and the theory of graphs embedded in surfaces are fundamentally interconnected. Robertson and Seymour used graph minors to prove a generalization of the Kuratowski Theorem to arbitrary surfaces [37], while they also need surface embeddings in their Excluded Minor Theorem [45]. Various recent results related to graph minors and graphs on surfaces are presented.
متن کامل