String graphs are quasi-isometric to planar graphs
James Davies

TL;DR
This paper proves that string graphs are quasi-isometric to planar graphs, allowing many properties and algorithms from planar graphs to be extended to string graphs and related structures.
Contribution
The authors establish a quasi-isometry between string graphs and planar graphs, extending several geometric and algorithmic results to string graphs.
Findings
String graphs are quasi-isometric to planar graphs with explicit bounds.
String graphs have Assouad-Nagata dimension at most 2.
Polynomial time algorithms exist for generating quasi-isometric planar graphs from string graphs.
Abstract
We prove that for every countable string graph , there is a planar graph with such that \[ \frac{1}{23660800}d_S(u,v) \le d_G(u,v) \le 162 d_S(u,v) \] for all , where , denotes the distance between and in and respectively. In other words, string graphs are quasi-isometric to planar graphs. This theorem lifts a number of theorems from planar graphs to string graphs, we give some examples. String graphs have Assouad-Nagata (and asymptotic dimension) at most 2. Connected, locally finite, quasi-transitive string graphs are accessible. A finitely generated group is virtually a free product of free and surface groups if and only if is quasi-isometric to a string graph. Two further corollaries are that countable planar metric graphs and complete Riemannian planes are also quasi-isometric to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
