Planarity conjecture for quasi-transitive graphs quasi-isometric to minor-excluded graphs
Statement
A graph is minor-excluded if some finite graph is not a minor of . 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 be a connected, locally finite, quasi-transitive graph, and suppose is quasi-isometric to a minor-excluded graph. Then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.