9 research outputs found

    Polynomial growth and asymptotic dimension

    Get PDF
    We show that a graph of polynomial growth strictly less than nk+1n^{k+1} has asymptotic dimension at most kk. As a corollary Riemannian manifolds of bounded geometry and polynomial growth strictly less than nk+1n^{k+1} have asymptotic dimension at most kk.Comment: 13 page

    Asymptotic dimension of planes and planar graphs

    Get PDF
    We show that the asymptotic dimension of a geodesic space that is homeomorphic to a subset in the plane is at most three. In particular, the asymptotic dimension of the plane and any planar graph is at most three.Comment: Definitions of M-fat theta curve and M-coarse cactus are slightly changed. The proof of Theorem 3.2 (it used to be Theorem 3.1) is changed and now simpler. Some references are added, in particular [16] by Jorgensen and Lan

    Surfaces have (asymptotic) dimension 2

    Full text link
    The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale version of weak diameter colorings (also known as weak diameter network decompositions), i.e. colorings in which each monochromatic component has small weak diameter. In this paper, we prove that for any pp, the class of graphs excluding K3,pK_{3,p} as a minor has asymptotic dimension at most 2. This implies that the class of all graphs embeddable on any fixed surface (and in particular the class of planar graphs) has asymptotic dimension 2, which gives a positive answer to a recent question of Fujiwara and Papasoglu. Our result extends from graphs to Riemannian surfaces. We also prove that graphs of bounded pathwidth have asymptotic dimension at most 1 and graphs of bounded layered pathwidth have asymptotic dimension at most 2. We give some applications of our techniques to graph classes defined in a topological or geometrical way, and to graph classes of polynomial growth. Finally we prove that the class of bounded degree graphs from any fixed proper minor-closed class has asymptotic dimension at most 2. This can be seen as a large scale generalization of the result that bounded degree graphs from any fixed proper minor-closed class are 3-colorable with monochromatic components of bounded size. This also implies that (infinite) Cayley graphs avoiding some minor have asymptotic dimension at most 2, which solves a problem raised by Ostrovskii and Rosenthal.Comment: 35 pages, 4 figures - v3: correction of the statements of Theorem 5.2, Corollary 5.3 and Theorem 5.9. Most of the results in this paper have been merged to arXiv:2012.0243

    Sharp finiteness principles for Lipschitz selections

    Full text link
    Let (M,ρ)(M,\rho) be a metric space and let YY be a Banach space. Given a positive integer mm, let FF be a set-valued mapping from MM into the family of all compact convex subsets of YY of dimension at most mm. In this paper we prove a finiteness principle for the existence of a Lipschitz selection of FF with the sharp value of the finiteness constant.Comment: 57 pages. arXiv admin note: substantial text overlap with arXiv:1708.0081
    corecore