Robertson and the second author  proved in 1986 that for all h there exists f(h) such that for every h-vertex simple planar graph H, every graph with no H-minor has tree-width at most f(h); but how small can we make f(h)? The original bound was an iterated exponential tower, but in 1994 with Thomas  it was improved to 2O(h5); and in 1999 Diestel, Gorbunov, Jensen, and Thomassen  proved a similar bound, with a much simpler proof. Here we show that f(h)=2O(hlog(h)) works. Since this paper was submitted for publication, Chekuri and Chuzhoy  have announced a proof that in fact f(h) can be taken to be O(h100).
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Graph minors