71Accesses
5Citations
Abstract
LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY1,Y2,... such thatX is a covering graph of each of these graphs and everyYk,k≥2, is covering graph of the graphsY1,...,Yk-1. IfX is in additions-transitive for somes≥2 the graphsYi can be assumed to be at leasts-transitive.
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
Similar content being viewed by others
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph
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
N. Seifter
Present address: f. Mathematik, Montanuniversitaet Leoben, A-8700, Leoben, Austria
Authors and Affiliations
Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
C. D. Godsil & N. Seifter
- C. D. Godsil
You can also search for this author inPubMed Google Scholar
- N. Seifter
You can also search for this author inPubMed Google Scholar
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 Combinatorics8, 233–241 (1992). https://doi.org/10.1007/BF02349960
Received:
Revised:
Issue Date: