Asymmetrizing infinite trees

MaRDI QIDQ6424327zbMATH OpenFDO

Authors Wilfried Imrich, Rafał Kalinowski, Florian Lehner, Monika Pilśniak, Marcin Stawiski

Publication date 24 January 2023

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Abstract: A graph $G$ is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion $m$ of a graph is the minimum number of vertices moved by any non-identity automorphism. It is known that infinite trees $T$ with motion $m=alep{h}_0$ are asymmetrizable if the vertex-degrees are bounded by $2^m.$ We show that this also holds for arbitrary, infinite $m$, and that the number of inequivalent asymmetrizing sets is $2^{|T|}$.

This page was built for publication: Asymmetrizing infinite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6424327)