2000 character limit reached
Quasi-transitive $K_\infty$-minor free graphs
Published 27 May 2024 in math.CO | (2405.17218v1)
Abstract: We prove that every locally finite quasi-transitive graph that does not contain $K_\infty$ as a minor is quasi-isometric to some planar quasi-transitive locally finite graph. This solves a problem of Esperet and Giocanti and improves their recent result that such graphs are quasi-isometric to some planar graph of bounded degree.
- Canonical trees of tree-decomposition. J. Combin. Theory (Series B), 152:1–26, 2022.
- L. Esperet and U. Giocanti. Coarse geometry of quasi-transitive graphs beyond planarity. arXiv:2312.08902.
- The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. arXiv:2304.01823.
- A. Georgakopoulos and P. Papasoglu. Graph minors and metric spaces. arXiv:2305.07456.
- R. Halin. Über die Maximalzahl fremder unendlicher Wege. Math. Nachr., 30:63–85, 1965.
- A Stallings type theorem for quasi-transitive graphs. J. Combin. Theory (Series B), 157:40–69, 2022.
- J. MacManus. Accessibility, planar graphs and quasi-isometries. arXiv:2310.15242.
- C. Thomassen. The Hadwiger number of infinite vertex-transitive graphs. Combinatorica, 12:481–491, 1992.
- C. Thomassen and W. Woess. Vertex-transitive graphs and accessibility. J. Combin. Theory (Series B), 58(2):248–268, 1993.
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.