Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A stronger structure theorem for excluded topological minors (1209.0129v1)

Published 1 Sep 2012 in math.CO and cs.DM

Abstract: Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater than D or almost embed in some surface of genus at most g. We strengthen this result, giving a more precise description of the latter kind of basic graphs of the decomposition - we only allow graphs that (almost) embed in ways that are impossible for H (similarly to the structure theorem for minors, where only graphs almost embedded in surfaces in that H does not embed are allowed). This enables us to give structural results for graphs avoiding a fixed graph as an immersion and for graphs with bounded infinity-admissibility.

Citations (19)

Summary

We haven't generated a summary for this paper yet.