✦ LIBER ✦

A note on bounded automorphisms of infinite graphs

✍ Scribed by Chris D. Godsil; Wilfried Imrich; Norbert Seifter; Mark E. Watkins; Wolfgang Woess

Publisher: Springer Japan
Year: 1989
Tongue: English
Weight: 439 KB
Volume: 5
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

A note on infinite transitive graphs

✍ Norbert Seifter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

In [4] Jung and Watkins proved that for a connected infinite graph X either r®(X) = oo holds or X is a strip, if Aut(X) contains a transitive abelian subgroup G. Here we prove the same result under weaker assumptions.

A Note on Intertwines of Infinite Graphs

✍ B. Oporowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro

A note on graphs with countable automorp

A note on graphs with countable automorphism group

✍ Rudolf Halin 📂 Article 📅 2000 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 306 KB

Note on vertex-partitions of infinite gr

Note on vertex-partitions of infinite graphs

✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

A note on construction of upper bound gr

A note on construction of upper bound graphs

✍ Hiroshi Era; Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiyao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB