On automorphisms of infinite graphs with forbidden subgraphs

Let X be an m-connected graph such that for all n, no subgraph of X is homeomorphic to the complete bipartite graph \(K_{m,n}\). Let \(\alpha\) be an automorphism of X having an orbit of infinite length. It is shown that, under these conditions, (1) any finite orbit of \(\alpha\) has length \(\leq m-1\), and (2) \(\alpha\) fixes at most two ends. A result of \textit{H. Fleischner} [Compositio Math. 23, 435-444 (1971; Zbl 0224.05113)] is extended to infinite graphs as follows: let X be a 3-connected graph imbedded in the plane and let \(\alpha\) be a nonidentity, orientation- preserving automorphism of X. Then \(\alpha\) has at most two fixed points while all other orbits have the same length greater than 1.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: On automorphisms of infinite graphs with forbidden subgraphs

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