Abstract
We prove that every infinite, locally finite 3-connected, almost 4-connected, almost transitive, nonplanar graph, which contains infinitely many pairwise disjoint infinite paths belonging to the same end, can be contracted into an infinite complete graph. This implies that every infinite, locally finite, connected, nonplanar vertex-transitive graph with only one end can be contracted into an infinite complete graph. This problem was raised by L. Babai.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Babai: problem posed in 1989.
L. Babai, andM. E. Watkins: Connectivity of infinite graphs having a torsion group action,Arch. Math. 34 (1980), 90–96.
C. Godsil, andN. Seifter: private communication 1991.
R. Halin: Automorphisms and endomorphisms of infinite, locally finite graphs,Abh. Math. Sem. Univ. Hamburg 39 (1973), 251–283.
H. A. Jung, andM. E. Watkins: On the connectivities of finite and infinite graphs,Monatsh. Math. 83 (1977), 121–131.
C. Thomassen: 2-linked graphs,Europ. J. Combinatorics 1 (1980), 371–378.
C. Thomassen:Infinite graphs, in: Selected Topics in Graph Theory 2 (L. W. Beineke and R. J. Wilson, eds.) Academic Press, London 1983, 129–160.
W. Woess: Graphs and groups with tree-like properties,J. Combin. Theory, Ser. B47 (1989), 361–371.