Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 174 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 34 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Grid Minors and Products (2402.14181v3)

Published 21 Feb 2024 in math.CO and cs.DM

Abstract: Motivated by recent developments regarding the product structure of planar graphs, we study relationships between treewidth, grid minors, and graph products. We show that the Cartesian product of any two connected $n$-vertex graphs contains an $\Omega(\sqrt{n})\times\Omega(\sqrt{n})$ grid minor. This result is tight: The lexicographic product (which includes the Cartesian product as a subgraph) of a star and any $n$-vertex tree has no $\omega(\sqrt{n})\times\omega(\sqrt{n})$ grid minor.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Graph product structure for hℎhitalic_h-framed graphs. In Sang Won Bae and Heejin Park, eds., Proc. 33rd Int’l Symp. on Algorithms and Computation (ISAAC ’22), vol. 248 of LIPIcs, pp. 23:1–23. Schloss Dagstuhl, 2022. arXiv:2204.11495.
  2. Nonserial dynamic programming. Academic Press, 1972.
  3. Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). 2022, arXiv:2202.11858.
  4. Asymptotically optimal vertex ranking of planar graphs. 2020, arXiv:2007.06455.
  5. Some remarks on the Kronecker product of graphs. Inf. Process. Lett., 68(2):55–61, 1998.
  6. L. Sunil Chandran and T. Kavitha. The treewidth and pathwidth of hypercubes. Discrete Math., 306(3):359–365, 2006.
  7. Polynomial bounds for the grid-minor theorem. J. ACM, 63(5):40, 2016.
  8. Towards tight(er) bounds for the excluded grid theorem. J. Combin. Theory Ser. B, 146:219–265, 2021.
  9. Bruno Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput., 85(1):12–75, 1990.
  10. Subexponential parameterized algorithms on bounded-genus graphs and H𝐻Hitalic_H-minor-free graphs. J. ACM, 52(6):866–893, 2005.
  11. Diameter and treewidth in minor-closed graph families, revisited. Algorithmica, 40(3):211–215, 2004.
  12. Quickly deciding minor-closed parameters in general graphs. European J. Combin., 28(1):311–314, 2007.
  13. Algorithmic graph minor theory: improved grid minor bounds and Wagner’s contraction. Algorithmica, 54(2):142–180, 2009.
  14. Reinhard Diestel. Graph theory, vol. 173 of Graduate Texts in Mathematics. Springer, 4th edn., 2010.
  15. Highly connected sets and the excluded grid theorem. J. Combin. Theory Ser. B, 75(1):61–73, 1999.
  16. Improved product structure for graphs on surfaces. Discrete Math. Theor. Comput. Sci., 24(2):#6, 2022.
  17. Powers of planar graphs, product structure, and blocking partitions. 2023, arXiv:2308.06995.
  18. Improved bounds for centered colorings. Adv. Comb., #8, 2021.
  19. Adjacency labelling for planar graphs (and beyond). J. ACM, 68(6):42, 2021.
  20. Planar graphs have bounded nonrepetitive chromatic number. Adv. Comb., #5, 2020a.
  21. Clustered 3-colouring graphs of bounded degree. Combin. Probab. Comput., 31(1):123–135, 2022a.
  22. The grid-minor theorem revisited. 2023, arXiv:2307.02816. SODA 2024, to appear.
  23. Planar graphs have bounded queue-number. J. ACM, 67(4):#22, 2020b.
  24. Bounded-degree planar graphs do not have bounded-degree product structure. 2022b, arXiv:2212.02388.
  25. Layered separators in minor-closed graph classes with applications. J. Combin. Theory Ser. B, 127:111–147, 2017.
  26. Graph product structure for non-minor-closed classes. J. Combin. Theory Ser. B, 162:34–67, 2023.
  27. On comparable box dimension. In Xavier Goaoc and Michael Kerber, eds., Proc. 38th Int’l Symp. on Computat. Geometry (SoCG 2022), vol. 224 of LIPIcs, pp. 38:1–38:14. Schloss Dagstuhl, 2022.
  28. David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3–4):275–291, 2000.
  29. David Eppstein. Grid minors in damaged grids. Electron. J. Combin., 21(3):3, 2014.
  30. On the treewidth of Hanoi graphs. Theoret. Comput. Sci., 906:1–17, 2022.
  31. Parameterized leaf power recognition via embedding into graph products. Algorithmica, 82(8):2337–2359, 2020.
  32. Sparse universal graphs for planarity. J. London Math. Soc., 108(4):1333–1357, 2023.
  33. Leonhard Euler. De summis serierum reciprocarum. Commentarii Academiae Scientiarum Petropolitanae, 7:123–134, 1740.
  34. Excluded grid minors and efficient polynomial-time approximation schemes. J. ACM, 65(2), 2018.
  35. Rudolf Halin. S𝑆Sitalic_S-functions for graphs. J. Geometry, 8(1-2):171–186, 1976.
  36. Parameters tied to treewidth. J. Graph Theory, 84(4):364–385, 2017.
  37. Structural properties of graph products. J. Graph Theory, 2023b. arXiv:2110.00721.
  38. Shallow minors, graph products and beyond planar graphs. SIAM J. Discrete Math., accepted in 2023a. arXiv:2111.12412.
  39. Product structure of graphs with an excluded minor. 2022, arXiv:2104.06627. Trans. Amer. Math. Soc., to appear.
  40. Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. In Michael A. Bekos and Michael Kaufmann, eds., Proc. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), vol. 13453 of Lecture Notes in Comput. Sci., pp. 287–299. Springer, 2022.
  41. Linear min-max relation between the treewidth of an H𝐻Hitalic_H-minor-free graph and its largest grid minor. J. Combin. Theory Ser. B, 141:165–180, 2020.
  42. Lower bounds for treewidth of product graphs. Discrete Appl. Math., 162:251–258, 2014.
  43. Twin-width of graphs on surfaces. 2023, arXiv:2307.05811.
  44. Tree-width and planar minors. J. Combin. Theory Ser. B, 111:38–53, 2015.
  45. Flaminia L. Luccio. Almost exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett., 66(2):59–64, 1998.
  46. Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B, 41(1):92–114, 1986.
  47. Quickly excluding a planar graph. J. Combin. Theory Ser. B, 62(2):323–348, 1994.
  48. Graph minors. III. Planar tree-width. J. Combin. Theory, Ser. B, 36(1):49–64, 1984.
  49. Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B, 58(1):22–33, 1993.
  50. An improved planar graph product structure theorem. Electron. J. Combin., 29:P2.51, 2022.
  51. David R. Wood. Clique minors in Cartesian products of graphs. New York J. Math., 17:627–682, 2011. arXiv:0711.1189.
  52. David R. Wood. Treewidth of cartesian products of highly connected graphs. J. Graph Theory, 73(3):318–321, 2013.

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up