English

A short derivation of the structure theorem for graphs with excluded topological minors

Combinatorics 2018-07-04 v1

Abstract

As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph HH as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded genus. Recently, Grohe and Marx proved a similar result for graphs not containing HH as a topological minor. They showed that every graph which does not contain HH as a topological minor has a tree-decomposition in which every torso is either almost embeddable in a surface of bounded genus, or has a bounded number of vertices of high degree. We give a short proof of the theorem of Grohe and Marx, improving their bounds on a number of the parameters involved.

Keywords

Cite

@article{arxiv.1807.01119,
  title  = {A short derivation of the structure theorem for graphs with excluded topological minors},
  author = {Joshua Erde and Daniel Weißauer},
  journal= {arXiv preprint arXiv:1807.01119},
  year   = {2018}
}

Comments

9 pages