On the immersion relation and an embedding problem for infinite graphs
type: Item
instance of: scholarly article
title: On the immersion relation and an embedding problem for infinite graphs
zbMATH Open document ID: 0999.05095
DOI: 10.1007/BF03322752
author: Thomas Andreae
published in: Results in Mathematics
publication date: 2002-12-02T00:00:00Z
review text: The author shows that there exist (uncountable) graphs \(A\) and \(G\) such that \(G\) contains \(n\) disjoint copies of \(A\) for every positive integer \(n\), but the graph consisting of denumerably many disjoint copies of \(A\) does not embed in \(G\), where by ``embedding'' he means ``immersion in the weak sense''.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 1760639
zbMATH Keywords: immersion
zbMATH Keywords: embedding
zbMATH Keywords: infinite graphs
reviewed by: Arthur T. White
MaRDI profile type: Publication
cites work: Q3097395
cites work: Über die Maximalzahl fremder unendlicher Wege in Graphen
cites work: Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
cites work: A problem in infinite graph-theory
cites work: On a problem of R. Halin concerning infinite graphs
cites work: Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)
cites work: On a problem of R. Halin concerning infinite graphs. II
cites work: Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen
cites work: A problem concerning infinite graphs
cites work: A note on a problem of Halin's
cites work: Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
cites work: Graph minors. XVII: Taming a vortex
cites work: Graph minors. XX: Wagner's conjecture
cites work: Q5520569
cites work: A Glance at Graph Theory-Part II
cites work: A counter-example to ‘Wagner's conjecture’ for infinite graphs
description: scientific article; zbMATH DE number 1760639