On a theorem of Halin
From MaRDI portal
Abstract: This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite automorphism group whose cardinality is strictly less than continuum, has a finite set F of vertices that is setwise stabilized only by the identity automorphism. A bound on the size of such sets, which are called distinguishing, is also provided. To put this theorem of Halin and its generalization into perspective, we also discuss several related non-elementary, independent results and their methods of proof.
Recommendations
Cites work
- A note on automorphism groups of countably infinite structures
- Asymmetric trees with two prescribed degrees
- Automorphisms and endomorphisms of infinite locally finite graphs
- Chains of subgroups in symmetric groups
- scientific article; zbMATH DE number 44603 (Why is no real title available?)
- scientific article; zbMATH DE number 3372013 (Why is no real title available?)
- Infinite graphs with finite 2-distinguishing cost
- Local definability theory
- Small label classes in 2-distinguishing labelings
- Subgroups of small Index in infinite Symmetric Groups
- Symmetry breaking in graphs
Cited in
(5)- Remarks on an elementary proof of Halász's theorem
- On a theorem of Helly
- scientific article; zbMATH DE number 4005283 (Why is no real title available?)
- scientific article; zbMATH DE number 96088 (Why is no real title available?)
- scientific article; zbMATH DE number 7678748 (Why is no real title available?)
This page was built for publication: On a theorem of Halin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688265)