2000 character limit reached
Counterexample to the conjectured coarse grid theorem
Published 21 Aug 2025 in math.CO and math.MG | (2508.15342v1)
Abstract: We show that for every $M,A,n \in \mathbb{N}$ there exists a graph $G$ that does not contain the $(154\times 154)$-grid as a $3$-fat minor and is not $(M,A)$-quasi-isometric to a graph with no $K_n$ minor. This refutes the conjectured coarse grid theorem by Georgakopoulos and Papasoglu and the weak fat minor conjecture of Davies, Hickingbotham, Illingworth, and McCarty. Our construction is a slight modification of the recent counterexample to the weak coarse Menger conjecture from Nguyen, Scott and Seymour.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.