On vertex transitive graphs of infinite degree (Q689779): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Reinhard Diestel / rank | |||
Property / author | |||
Property / author: Heinz A. Jung / rank | |||
Property / author | |||
Property / author: Rögnvaldur G. Möller / rank | |||
Property / reviewed by | |||
Property / reviewed by: Mark E. Watkins / rank | |||
Property / author | |||
Property / author: Reinhard Diestel / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Heinz A. Jung / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Rögnvaldur G. Möller / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Mark E. Watkins / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The end structure of a graph: Recent results and open problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on bounded automorphisms of infinite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über unendliche Wege in Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über die Maximalzahl fremder unendlicher Wege in Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automorphisms and endomorphisms of infinite locally finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on fragments of infinite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the connectivities of finite and infinite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fragments and automorphisms of infinite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ends of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3484856 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:43, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On vertex transitive graphs of infinite degree |
scientific article |
Statements
On vertex transitive graphs of infinite degree (English)
0 references
15 November 1993
0 references
A graph \(X\) is said to be shuffled by a subgroup \(G\) of its automorphism group \(\Aut(X)\) if for every infinite \(C \subseteq V(X)\) with finite boundary \(\partial C\) and every finite \(F \subseteq V(X)\), there exists \(\sigma \in G\) such that \(\sigma (F) \subseteq C\). The first main result is that every connected graph \(X\) of finite diameter is shuffled by any \(G \leq \Aut(X)\) that acts transitively on \(V(X)\). One may replace ``of finite diameter'' with ``having more than one end''. A bisection of \(X\) is a partition \(\{C_ 1,F,C_ 2\}\) of \(V(X)\), where \(C_ 1\) and \(C_ 2\) are infinite, \(F\) is finite, and \(\partial C_ 1\), \(\partial C_ 2 \subseteq F\). The second main result is that if \(G\) acts transitively on \(V(X)\), then for any bisection \(\{C_ 1,F,C_ 2\}\) of \(V(X)\), there exists \(\sigma \in G\) with no finite orbit such that \(\sigma\) and \(\sigma^{-1}\) have distinct directions and \(\sigma(F \cup C_ 1) \subseteq C_ 1\). Several results that are known for locally finite graphs are then proved with the local finiteness restriction removed. Among these are: (1) Every transitive connected graph with \(>2\) ends has no free end; (2) Every transitive connected graph has 1,2 or \(\geq 2^{\aleph_ 0}\) ends; (3) In a transitive connected graph with \(\geq 2\) ends, an automorphism is bounded if and only if it fixes every end.
0 references
vertex transitive graphs
0 references
automorphism group
0 references
diameter
0 references
bisection
0 references
locally finite graphs
0 references
free end
0 references
bounded
0 references