ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a planar graph. A graph is HH-induced-minor-free if it does not contain HH as an induced minor, and a graph is qq-quasi-isometric to a graph of treewidth at most kk if such a quasi-isometry exists with parameter qq.

Georgakopoulos's coarse grid minor conjecture. For every planar graph HH, there exist k,q∈Nk,q\in\mathbb{N} such that every HH-induced-minor-free graph is qq-quasi-isometric to a graph with treewidth at most kk.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.