✦ LIBER ✦

On finite fixed sets in infinite graphs

✍ Scribed by H.A. Jung

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 762 KB
Volume: 131
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90378-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 fixed end. Applications and refinements are discussed.

📜 SIMILAR VOLUMES

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

Finite Separating Sets in Locally Finite

Finite Separating Sets in Locally Finite Graphs

✍ H.A. Jung; M.E. Watkins 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 386 KB

An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va

Large k-preserving sets in infinite grap

Large k-preserving sets in infinite graphs

✍ Andreas Huck; Frank Niedermeyer; Saharon Shelah 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

## Abstract Let __K__ be a cardinal. If __K__ χ~0~, define K:= __K__. Otherwise, let __K__ := __K__ + 1. We prove a conjecture of Mader: Every infinite __K__‐connected graph __G__ = (__V, E__) contains a set __S__ ⊆ __V__ with |__S__| = |__V__| such that __G/S__ is __K__‐connected for all __S__⊆ __

Note on the reconstruction of infinite g

Note on the reconstruction of infinite graphs with a fixed finite number of components

✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G

Cut-sets in infinite graphs and partial

Cut-sets in infinite graphs and partial orders

✍ A. Hajnal; N. Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117 (1993) 113-125. The set S c V(U) is a cut-set of the vertex v of a graph 9 if v is not adjacent to any vertex in S and, for every maximal clique C of Q, ({v} u S) n C # 0. S is a cut-set of the element

On disjoint configurations in infinite g

On disjoint configurations in infinite graphs

✍ Thomas Andreae 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract For a graph __A__ and a positive integer __n__, let __nA__ denote the union of __n__ disjoint copies of __A__; similarly, the union of ℵ~0~ disjoint copies of __A__ is referred to as ℵ~0~__A__. It is shown that there exist (connected) graphs __A__ and __G__ such that __nA__ is a minor o