On the immersion relation and an embedding problem for infinite graphs (Q1601389)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the immersion relation and an embedding problem for infinite graphs |
scientific article |
Statements
On the immersion relation and an embedding problem for infinite graphs (English)
0 references
2 December 2002
0 references
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''.
0 references
immersion
0 references
embedding
0 references
infinite graphs
0 references
0 references
