Infinite games on finite sets
โ Scribed by Uri Abraham; Rene Schipperus
- Book ID
- 107528965
- Publisher
- The Hebrew University Magnes Press
- Year
- 2007
- Tongue
- English
- Weight
- 185 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0021-2172
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## An automorphism of a graph X is called a translation of X if it fixes no finite non-empty set of vertices of X. It is shown that a group G of automorphisms of the connected graph X fixes a finite non-empty set of vertices or ends of X if and only if any two translations of X in G have a common
The closure of a set A of vertices of an infinite graph G is defined as the set of vertices of G which cannot be finitely separated from A. A subset A of Y(G) is dispersed if it is finitely separated from any ray of G. It is shown that the closure of any dispersed set A of an infinite connected grap