ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K,n,m,r∈NK,n,m,r\in\mathbb{N}. A graph is (M,A)(M,A)-quasi-isometric to a graph of tree-width at most gg in the usual coarse sense, and connected sets are at least KK apart when every pair of vertices from distinct sets has distance at least KK. Then there exist some M,A,g∈NM,A,g\in\mathbb{N} such that every graph with no (M,A)(M,A)-quasi-isometry to a graph of tree-width at most gg contains connected sets U1,…,UnU_1,\ldots,U_n that are pairwise at least KK apart and such that for every pair 1⩽i<j⩽n1\leqslant i<j\leqslant n, there exist no mm balls of radius at most rr hitting all paths between UiU_i and UjU_j. Coarse connectivity witness conjecture.

This proposes a coarse analogue of the connectivity-witness step in proofs of the classical grid theorem. The paper explains that the coarse Menger step fails, but leaves this alternative structural statement open.

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.