2000 character limit reached
Fat minors cannot be thinned (by quasi-isometries)
Published 15 May 2024 in math.CO and math.MG | (2405.09383v1)
Abstract: We disprove the conjecture of Georgakopoulos and Papasoglu that a length space (or graph) with no $K$-fat $H$ minor is quasi-isometric to a graph with no $H$ minor. Our counterexample is furthermore not quasi-isometric to a graph with no 2-fat $H$ minor or a length space with no $H$ minor. On the other hand, we show that the following weakening holds: any graph with no $K$-fat $H$ minor is quasi-isometric to a graph with no $3$-fat $H$ minor.
- A Menger-type theorem for two induced paths. arXiv:2305.04721.
- Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces. To appear in Journal of the European Mathematical Society.
- Martin R. Bridson and André Haefliger (1999). Metric spaces of non-positive curvature, Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 319 (Springer-Verlag).
- Hans L. Bodlaender (1988). Planar graphs with bounded treewidth. Tech. Rep. RUU-CS-88-14, Department of Computer Science, University of Utrecht.
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. Discrete & Computational Geometry 47, 187–214.
- Koji Fujiwara and Panos Papasoglu (2023). A coarse-geometry characterization of cacti. arXiv:2305.08512.
- On induced versions of Menger’s theorem on sparse graphs. arXiv:2309.08169.
- Agelos Georgakopoulos and Panos Papasoglu (2023). Graph minors and metric spaces. arXiv:2305.07456.
- On an induced version of Menger’s theorem. arXiv:2309.07905.
- Kazimierz Kuratowski (1930). Sur le problème des courbes gauches en topologie. Fundamenta Mathematicae 15(1), 271–283.
- Jason Fox Manning (2005). Geometry of pseudocharacters. Geometry & Topology 9(2), 1147–1185.
- A counterexample to the coarse Menger conjecture. arXiv:2401.06685.
- Neil Robertson and Paul Seymour (2003). Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B 89(1), 43–76.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.