𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large k-preserving sets in infinite graphs

✍ Scribed by Andreas Huck; Frank Niedermeyer; Saharon Shelah

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
715 KB
Volume
18
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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βŠ† S.

πŸ“œ 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

Large classes of infinite k-cop-win grap
Large classes of infinite k-cop-win graphs
✍ Anthony Bonato; Geňa Hahn; Claude Tardif πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 1 views

While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite car

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

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