Georgakopoulos coarse grid minor conjecture
Statement
Let be a planar graph. A graph is -induced-minor-free if it does not contain as an induced minor, and a graph is -quasi-isometric to a graph of treewidth at most if such a quasi-isometry exists with parameter .
Georgakopoulos's coarse grid minor conjecture. For every planar graph , there exist such that every -induced-minor-free graph is -quasi-isometric to a graph with treewidth at most .
The conjecture is a coarse analogue of the grid-minor obstruction principle and is described as a major open problem in coarse graph theory. The paper notes that the original formulation uses forbidden fat-minors, which is more general than forbidden induced minors.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.