Bounded diameter tree-decompositions (2306.13282v3)
Abstract: When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded tree-length''. We will show that this is equivalent to being
boundedly quasi-isometric to a tree'', which for infinite graphs is a much-studied property from metric geometry. One object of this paper is to tie these two areas together. We will prove that there is a tree-decomposition in which each bag has small diameter, if and only if there is a map $\phi$ from $V(G)$ into the vertex set of a tree $T$, such that for all $u,v\in V(G)$, the distances $d_G(u,v), d_T(\phi(u),\phi(v))$ differ by at most a constant. A geodesic loaded cycle'' in $G$ is a pair $(C,F)$, where $C$ is a cycle of $G$ and $F\subseteq E(C)$, such that for every pair $u,v$ of vertices of $C$, one of the paths of $C$ between $u,v$ contains at most $d_G(u,v)$ $F$-edges, where $d_G(u,v)$ is the distance between $u,v$ in $G$. We will show that a graph $G$ admits a tree-decomposition in which every bag has small diameter, if and only if $|F|$ is small for every geodesic loaded cycle $(C,F)$. Our proof is an extension of an algorithm to approximate tree-length in finite graphs by Dourisboure and Gavoille. In metric geometry, there is a similar theorem that characterizes when a graph is quasi-isometric to a tree,
Manning's bottleneck criterion''. The goal of this paper is to tie all these concepts together, and add a few more related ideas. For instance, we prove a conjecture of Rose McCarty, that $G$ admits a tree-decomposition in which every bag has small diameter, if and only if for all vertices $u,v,w$ of $G$, some ball of small radius meets every path joining two of $u,v,w$.
- S. Balasubramanya, “Acylindrical group actions on quasi-trees”, Algebraic and Geometric Topology 17 (2017), 2145–2176.
- M. Bestvina, K. Bromberg and K, Fujiwara, “Constructing group actions on quasi-trees and applications to mapping class groups”, Publications mathématiques de l’IHÉS 122 (2015), 1–64.
- C. Chekuri and J. Chuzhoy, “Polynomial bounds for the grid-minor theorem”, J. American Math. Soc. 63 (2016), 1–65.
- V. Chepoi, F. Dragan, I. Newman, Y. Rabinovich, and Y. Vaxès, “Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs”, Discrete & Computational Geometry 47 (2012), 187–214.
- J. Chuzhoy and Z. Tan, “Towards tight(er) bounds for the excluded grid theorem”, J. Combinatorial Theory, Ser. B, 146 (2021), 219–265.
- R. Diestel and M. Müller, “Connected tree-width”, Combinatorica 38 (2018), 381–398.
- T. Dissaux, G. Ducoffe, N. Nisse and S. Nivelle, “Treelength of series-parallel graphs”, Procedia Computer Science 195 (2021), 30–38.
- Y. Dourisboure and C. Gavoille, “Tree-decompositions with bags of small diameter”, Discrete Math. 307 (2007), 2008–2029.
- A. Georgakopoulos and P. Papasoglu, “Graph minors and metric spaces”, arXiv:2305.07456, 2023.
- A. Kerr, “Tree approximation in quasi-trees”, arXiv:2012.10741, 2021.
- D. Kratsch, H.-O. Le, H. Müller, E. Prisner and D. Wagner, “Additive tree spanners”, SIAM Journal on Discrete Mathematics 17 (2003), 332–340.
- J. F. Manning, “Geometry of pseudocharacters”, Geometry & Topology 9 (2005), 1147–1185.
- N. Robertson and P. Seymour, “Graph minors. V. Excluding a planar graph”, J. Combinatorial Theory, Ser. B, 41 (1986), 92–114.
- P. Seymour, “Tree-chromatic number”, J. Combinatorial Theory, Ser B, 116 (2016), 229–237.