On the Immersion Relation and an Embedding Problem for Infinite Graphs |
| |
| Authors: | Thomas Andreae |
| |
| Institution: | 1. Universit?t Hamburg Mathematisches Seminar, Bundesstra\e 55, D-20146, Hamburg, Germany
|
| |
| Abstract: | Recent results on the immersion relation for graphs are applied to show that there exist (uncountable) graphs A and G such that G contains n disjoint copies of A for each positive integer n, but the graph N0A consisting of infinitely many disjoint copies of A does not embed in G, where by ‘embedding’ we mean ‘immersion in the weak sense’. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
