๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finite invariant simplices in infinite graphs

โœ Scribed by N. Polat

Book ID
105333738
Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
663 KB
Volume
27
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Finite invariant sets in infinite graphs
Finite invariant sets in infinite graphs
โœ Norbert Polat ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 795 KB

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

Invariant Hamming graphs in infinite qua
Invariant Hamming graphs in infinite quasi-median graphs
โœ Marc Chastand; Norbert Polat ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 593 KB

It is shown that a quasi-median graph G without isometric infinite paths contains a Hamming graph (i.e., a cartesian product of complete graphs) which is invariant under any automorphism of G, and moreover if G has no infinite path, then any contraction of G into itself stabilizes a finite Hamming g

Invariants of finite comparability graph
Invariants of finite comparability graphs
โœ David Kelly ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 209 KB

We study some invariants of finite comparability graphs. AMS (MOS) subject classification (1980). 06AI0.

On finite fixed sets in infinite graphs
On finite fixed sets in infinite graphs
โœ H.A. Jung ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 762 KB

## 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