Excluding Surfaces as Minors in Graphs
From MaRDI portal
Publication:6510399
arXiv2306.01724MaRDI QIDQ6510399FDOQ6510399
Authors: Dimitrios M. Thilikos, Sebastian Wiederrecht
Abstract: We introduce an annotated extension of treewidth that measures the contribution of a vertex set to the treewidth of a graph This notion provides a graph distance measure to some graph property : A vertex set is a -treewidth modulator of to if the treewidth of in is at most and its removal gives a graph in This notion allows for a version of the Graph Minors Structure Theorem (GMST) that has no need for apices and vortices: -minor free graphs are those that admit tree-decompositions whose torsos have -treewidth modulators to some surface of Euler-genus This reveals that minor-exclusion is essentially tree-decomposability to a ``modulator-target scheme where the modulator is measured by its treewidth and the target is surface embeddability. We then fix the target condition by demanding that is some particular surface and define a ``surface extension of treewidth, where is the minimum for which admits a tree-decomposition whose torsos have a -treewidth modulator to being embeddable in We identify a finite collection of parametric graphs and prove that the minor-exclusion of the graphs in precisely determines the asymptotic behavior of for every surface It follows that the collection bijectively corresponds to the ``surface obstructions for i.e., surfaces that are minimally non-contained in
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83)
This page was built for publication: Excluding Surfaces as Minors in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510399)