ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph Γ\Gamma is minor-excluded if some finite graph is not a minor of Γ\Gamma. Two graphs are quasi-isometric when their large-scale metric spaces are equivalent up to multiplicative and additive distortion. Planarity conjecture for minor-excluded quasi-isometry classes. Let Γ\Gamma be a connected, locally finite, quasi-transitive graph, and suppose Γ\Gamma is quasi-isometric to a minor-excluded graph. Then Γ\Gamma is quasi-isometric to a planar graph. The quasi-transitivity assumption is necessary, and this conjecture would imply the preceding accessibility conjecture; its verification for one-ended graphs would make the two conjectures equivalent.

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.