On a theorem of Halin (Q1688265)

The main result of this work is the following. If \(G\) is a graph with countably many vertices, then \(\text{Aut}(G)\) is countable or has cardinality \(2^{\aleph_0}\). Moreover, \(\text{Aut}(G)\) is countable if and only if \(\text{Aut}(G)\) has a finite base. This is, on one side, a generalization of a result from [\textit{R. Halin}, Abh. Math. Semin. Univ. Hamb. 39, 251--283 (1973; Zbl 0265.05118)] and, on the other hand, it presents a graph theoretical proof of the mentioned result, which was known even before Halin's paper in the different areas of mathematics (infinitary languages and mathematical logic). As a side effect a new bound on distinguishing number is presented as well.