The coarse connectivity witness conjecture
Statement
Let . A graph is -quasi-isometric to a graph of tree-width at most in the usual coarse sense, and connected sets are at least apart when every pair of vertices from distinct sets has distance at least . Then there exist some such that every graph with no -quasi-isometry to a graph of tree-width at most contains connected sets that are pairwise at least apart and such that for every pair , there exist no balls of radius at most hitting all paths between and . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.