✦ LIBER ✦

On self-immersions of infinite graphs

✍ Scribed by Thomas Andreae

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 132 KB
Volume: 58
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20308

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The existence of an infinite graph which is not isomorphic to a proper minor of itself was proved by Oporowski. In the present note, it is shown that an analogous result holds when immersions are considered instead of minors. The question whether or not the same is true for weak immersions remains open. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 275–285, 2008

📜 SIMILAR VOLUMES

Miscellaneous problems on infinite graph

Miscellaneous problems on infinite graphs

✍ R. Halin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

On highly ramsey infinite graphs

✍ M. H. Siggers 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract We show that, for __r__ ≥ 2 and __k__ ≥ 3, there exists a positive constant __c__ such that for large enough __n__ there are 2 non‐isomorphic graphs on at most __n__ vertices that are __r__‐ramsey‐minimal for the odd cycle __C__~2__k__+1~. © 2008 Wiley Periodicals, Inc. J Graph Theory 5

Constructing Infinite One-regular Graphs

✍ Aleksander Malnič; Dragan Marušič; Norbert Seifter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

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

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

On the notion of infinite Hamiltonian gr

On the notion of infinite Hamiltonian graph

✍ R. Halin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Based on the terms “end” and “cofinal spanning subtree” a general notion of Hamiltonicity of infinite graphs is developed. It is shown that the cube of every connected locally finite graph is Hamiltonian in this generalized sense.