Improved Bounds for the Excluded Grid Theorem

@article{Chuzhoy2016ImprovedBF,
  title={Improved Bounds for the Excluded Grid Theorem},
  author={Julia Chuzhoy},
  journal={CoRR},
  year={2016},
  volume={abs/1602.02629}
}
We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function f : Z → Z, such that for all integers g > 0, every graph of treewidth at least f(g) contains the (g×g)-grid as a minor. Until recently, the best known upper bounds on f were super-exponential in g. A recent work of Chekuri and Chuzhoy provided the first polynomial bound, by showing that treewidth f(g) = O(g poly log g) is sufficient to ensure the… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

Similar Papers

Loading similar papers…