Worley, David2025-09-082025-09-082025-09-08http://hdl.handle.net/10393/50837https://doi.org/10.20381/ruor-31376Motivated 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 graphs, each connected and each having n vertices, 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.enAttribution-NonCommercial 4.0 Internationalhttp://creativecommons.org/licenses/by-nc/4.0/Discrete MathematicsGraph TheoryGraph MinorsGrid GraphsGraph ProductsTreewidthThesis