Abstract
LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.
Similar content being viewed by others
References
Bass, H.: The degree of polynomial growth of finitely generated nilpotent groups. Proc. London Math. Soc. (3)25, 603–614 (1972)
Biggs, N.: Algebraic graph theory. Cambridge Tracts in Mathematics 67. Cambridge University Press 1974
Djoković, D.Z.: Automorphisms of graphs and coverings. J. Com. Theory (B)16, 243–247 (1974)
Godsil, C., Imrich, W., Seifter, N., Watkins, M.E., Woess, W.: A note on bounded automorphisms of infinite graphs. Graphs and Combinatorics5, 333–338 (1989)
Gromov, M.: Groups of polynomial growth and expanding maps. Inst. Hautes Etudes Sci. Publ. Math.53, 53–78 (1981)
Halin, R.: Ueber unendliche Wege in Graphen. Math. Ann.157, 125–137 (1964)
Imrich, W.: Subgroup theorems and graphs. Comb. Math., 5, Lect. Notes Math.622, 1–27 (1977)
Schwerdtfeger, H.: Introduction to Group Theory. Noordhoff International Publishing, Leyden 1976
Seifter, N.: Properties of graphs with polynomial growth. J. Com. Theory (B), (in print)
Trofimov, V.I.: Graphs with polynomial growth. USSR Sbornik51 405–417 (1985)
Wagon, S.: The Banach-Tarski Paradox. Encyclopedia of Mathematics 24, Cambridge Univ. Press, 1985
Weiss, R.: The nonexistence of 8-transitive graphs. Combinatorica1 (3) 309–311 (1981)
Author information
Authors and Affiliations
Additional information
Work of both authors was in part supported by NSERC grant A5367.
Rights and permissions
About this article
Cite this article
Godsil, C.D., Seifter, N. Graphs with polynomial growth are covering graphs. Graphs and Combinatorics 8, 233–241 (1992). https://doi.org/10.1007/BF02349960
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02349960