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 Ω(√n)×Ω(√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 ω(√n)×ω(√n) grid minor.
No takes yet. Share an insight, caveat, or question.
Dujmović et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: