Abstract
LetX be a connected graph with bounded valency and at least one thick end. We show that the existence of certain subgroups of the automorphism group ofX always implies thatX has infinite Hadwiger number.
Similar content being viewed by others
References
L. Babai, Some Applications of Graph Contractions, J. Graph Theory1 (1977), 125–130.
C. Godsil, W. Imrich, N. Seifter, M. Watkins, W. Woess, A Note on Bounded Automorphisms of Infinite Graphs, Graphs and Combinatorics5 (1989), 333–338.
R. Halin, Über unendliche Wege in Graphen, Math. Ann.157 (1964), 125–137.
R. Halin, Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen, Math. Nachr.44 (1970), 119–127.
R. Halin, Über die Maximalzahl fremder unendlicher Wege in Graphen, Math. Nachr.30 (1965), 63–85.
B.H. Neumann, Groups With Finite Classes of Conjugate Elements, Proc. Lond. Math. Soc. III, Ser.1 (1951), 178–187.
N. Seifter, Properties of Graphs with Polynomial Growth, J. Combin. Theory B52 (2) (1991), 222–235.
C. Thomassen, The Hadwiger Number of Vertex-transitive Graphs, preprint, 1991.
V.I. Trofimov, Graphs with Polynomial Growth, Math. USSR Sb.51 (1985), 405–417.
V.I. Trofimov, Automorphism Groups of Graphs as Topological Groups, Math. Notes38 (1985), 717–720.
W. Woess, Topological Groups and Infinite Graphs, preprint, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seifter, N. On the Hadwiger number of infinite graphs. Abh.Math.Semin.Univ.Hambg. 62, 207–215 (1992). https://doi.org/10.1007/BF02941627
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02941627