On automorphisms of infinite graphs with forbidden subgraphs (Q762491)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On automorphisms of infinite graphs with forbidden subgraphs |
scientific article; zbMATH DE number 3889557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On automorphisms of infinite graphs with forbidden subgraphs |
scientific article; zbMATH DE number 3889557 |
Statements
On automorphisms of infinite graphs with forbidden subgraphs (English)
0 references
1984
0 references
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.
0 references
plane graph
0 references
automorphism group
0 references
end
0 references
homeomorph
0 references
m-connected graph
0 references