Julia Chuzhoy
ABSTRACT
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 any integer g> 0, any graph of treewidth at least f(g), contains the (g x 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(g98 poly log g) is sufficient to ensure the existence of the (g x g)-grid minor in any graph. In this paper we provide a much simpler proof of the Excluded Grid Theorem, achieving a bound of $f(g)=O(g^{36} poly log g)$. Our proof is self-contained, except for using prior work to reduce the maximum vertex degree of the input graph to a constant.
- Matthew Andrews. Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions. In Proceedings of IEEE FOCS, pages 277--286, 2010. Google Scholar
Digital Library
- Chandra Chekuri and Julia Chuzhoy. Polynomial bounds for the grid-minor theorem. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pages 60--69, New York, NY, USA, 2014. ACM. Google ScholarDigital Library
- Chandra Chekuri and Julia Chuzhoy. Degree-3 treewidth sparsifiers. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4--6, 2015, pages 242--255. SIAM, 2015. Google ScholarDigital Library
- Chandra Chekuri and Alina Ene. Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 326--341. SIAM, 2013. Google ScholarDigital Library
- Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. A deletable edge lemma for general graphs. Manuscript, 2004.Google Scholar
- Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. Multicommodity flow, well-linked terminals, and routing problems. In Proc. of ACM STOC, pages 183--192, 2005. Google ScholarDigital Library
- Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. The all-or-nothing multicommodity flow problem. SIAM Journal on Computing, 42(4):1467--1493, 2013.Google ScholarDigital Library
- Chandra Chekuri and Nitish Korula. A graph reduction step preserving element-connectivity and applications. In Proc. of ICALP, pages 254--265, 2009. Google ScholarDigital Library
- Chandra Chekuri, Guyslain Naves, and F. Bruce Shepherd. Maximum edge-disjoint paths in k-sums of graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8--12, 2013, Proceedings, Part I, volume 7965 of Lecture Notes in Computer Science, pages 328--339. Springer, 2013. Google ScholarDigital Library
- Julia Chuzhoy. Routing in undirected graphs with constant congestion. In Proc. of ACM STOC, pages 855--874, 2012. Google ScholarDigital Library
- Julia Chuzhoy and Shi Li. A polylogarithimic approximation algorithm for edge-disjoint paths with congestion 2. In Proc. of IEEE FOCS, 2012. Google ScholarDigital Library
- E.D. Demaine and M Hajiaghayi. The Bidimensionality Theory and Its Algorithmic Applications. The Computer Journal, 51(3):292--302, November 2007. Google ScholarDigital Library
- Erik Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction. Algorithmica, 54:142--180, 2009. Google ScholarDigital Library
- Erik D Demaine and MohammadTaghi Hajiaghayi. Quickly deciding minor-closed parameters in general graphs. European Journal of Combinatorics, 28(1):311--314, January 2007. Google ScholarDigital Library
- Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012.Google Scholar
- Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, and Carsten Thomassen. Highly connected sets and the excluded grid theorem. J. Comb. Theory, Ser. B, 75(1):61--73, 1999. Google ScholarDigital Library
- Fedor V. Fomin, Saket Saurabh, and Dimitrios M. Thilikos. Strengthening Erdos-Pósa property for minor-closed graph classes. Journal of Graph Theory, 66(3):235--240, 2011. Google ScholarDigital Library
- H. R. Hind and O. Oellermann. Menger-type results for three or more vertices. Congressus Numerantium, 113:179--204, 1996.Google Scholar
- K. Kawarabayashi and Y. Kobayashi. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor. In Proc. of STACS, 2012.Google Scholar
- Rohit Khandekar, Satish Rao, and Umesh Vazirani. Graph partitioning using single commodity flows. J. ACM, 56(4):19:1--19:15, July 2009. Google ScholarDigital Library
- Stephan Kreutzer and Siamak Tazari. On brambles, grid-like minors, and parameterized intractability of monadic second-order logic. In Proc. of ACM-SIAM SODA, pages 354--364, 2010. Google ScholarDigital Library
- Alexander Leaf and Paul Seymour. Tree-width and planar minors. Journal of Combinatorial Theory, Series B, 2014.Google Scholar
- W. Mader. A reduction method for edge connectivity in graphs. Ann. Discrete Math., 3:145--164, 1978.Google ScholarCross Ref
- Harald R\"acke. Minimizing congestion in general networks. In Proc. of IEEE FOCS, pages 43--52, 2002. Google ScholarDigital Library
- Satish Rao and Shuheng Zhou. Edge disjoint paths in moderately connected graphs. SIAM J. Comput., 39(5):1856--1887, 2010. Google ScholarDigital Library
- Bruce Reed. Surveys in Combinatorics, chapter Treewidth and Tangles: A New Connectivity Measure and Some Applications. London Mathematical Society Lecture Note Series. Cambridge University Press, 1997.Google Scholar
- Bruce A Reed and David R Wood. Polynomial treewidth forces a large grid-like-minor. European Journal of Combinatorics, 33(3):374--379, April 2012. Google ScholarDigital Library
- N Robertson, P Seymour, and R Thomas. Quickly Excluding a Planar Graph. Journal of Combinatorial Theory, Series B, 62(2):323--348, November 1994. Google ScholarDigital Library
- Neil Robertson and P D Seymour. Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41(1):92--114, August 1986. Google ScholarDigital Library
- Neil Robertson and Paul D Seymour. Graph minors. XIII. the disjoint paths problem. Journal of Combinatorial Theory, Series B, 63(1):65--110, 1995. Google ScholarDigital Library
- Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In David S. Johnson and Uriel Feige, editors, STOC, pages 661--670. ACM, 2007. Google ScholarDigital Library
- C Thomassen. On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory, 12(1):101--111, 1988.Google ScholarCross Ref
Index Terms
- Excluded Grid Theorem: Improved and Simplified
Recommendations
The Directed Grid Theorem
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingThe grid theorem, originally proved in 1986 by Robertson and Seymour in Graph Minors V, is one of the most central results in the study of graph minors. It has found numerous applications in algorithmic graph structure theory, for instance in ...
Polynomial Bounds for the Grid-Minor Theorem
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 H, every graph whose treewidth is large enough relative to |V(H)| ...
Polynomial bounds for the grid-minor theorem
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingOne 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 fixed-size grid H, every graph whose treewidth is large enough, contains ...
Comments