Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polynomial Bounds for the Grid-Minor Theorem

Published 28 May 2013 in cs.DS and cs.DM | (1305.6577v5)

Abstract: One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid HH, every graph whose treewidth is large enough relative to ∣V(H)∣|V(H)| contains HH as a minor. This theorem has found many applications in graph theory and algorithms. Let f(k)f(k) denote the largest value such that every graph of treewidth kk contains a grid minor of size (f(k)×f(k))(f(k)\times f(k)). The best previous quantitative bound, due to recent work of Kawarabayashi and Kobayashi, and Leaf and Seymour, shows that f(k)=Ω(log⁡k/log⁡log⁡k)f(k)=\Omega(\sqrt{\log k/\log \log k}). In contrast, the best known upper bound implies that f(k)=O(k/log⁡k)f(k) = O(\sqrt{k/\log k}). In this paper we obtain the first polynomial relationship between treewidth and grid minor size by showing that f(k)=Ω(kδ)f(k)=\Omega(k^{\delta}) for some fixed constant δ>0\delta > 0, and describe a randomized algorithm, whose running time is polynomial in ∣V(G)∣|V(G)| and kk, that with high probability finds a model of such a grid minor in GG.

Authors (2)
Citations (123)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.