A coarse geometric approach to graph layout problems
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely they are monotonically non-decreasing with respect to a large-scale geometric generalisation of graph inclusion, and as such have potential applications in coarse geometry and geometric group theory. On the graph-theoretic side, we prove asymptotically optimal bounds on most of the above widths for the family of all finite subgraphs of any bounded degree graph whose separation profile is known to be of the form $r^a\log(r)^b$ for some $a>0$. This large class includes Diestel-Leader graphs, all Cayley graphs of non-virtually cyclic polycyclic groups, uniform lattices in almost all connected unimodular Lie groups, and many hyperbolic groups.