A note on graphs with countable automorphism group
From MaRDI portal
The paper solves the following problem from \textit{R. Halin} [J. Graph Theory 35, No. 2, 128--151 (2000; Zbl 0960.05001)]: If the automorphism group of a graph \(G\) is countable, then \(G\) contains a double-ray (i.e. a two-way infinite path).
Recommendations
- A note on groups with countable automorphism groups
- The group of almost automorphisms of the countable universal graph
- Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
- The automorphism group of finite graphs
- scientific article; zbMATH DE number 4061277
- scientific article; zbMATH DE number 3946167
- Automorphism groups of some classes of graphs
- On graphs with edge-transitive automorphism groups
- scientific article; zbMATH DE number 3880753
- On the automorphism group of integral circulant graphs
Cites work
- Charakterisierung der Graphen ohne unendliche Wege
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 1533074 (Why is no real title available?)
- The structure of rayless graphs
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
Cited in
(5)
This page was built for publication: A note on graphs with countable automorphism group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954698)