On the immersion relation and an embedding problem for infinite graphs

DOI10.1007/BF03322752MaRDI QIDQ1601389zbMATH OpenFDO

Authors Thomas Andreae

Publication date 2 December 2002

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03322752

zbMATH Keywords

embeddingimmersioninfinite graphs

Mathematics Subject Classification ID

Graph theory (05C99)

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.

Recommendations

• A note on immersion intertwines of infinite graphs
• On self‐immersions of infinite graphs
• On immersions of uncountable graphs
• Uncountable graphs with all their vertices in one face
• On disjoint configurations in infinite graphs

Cites work

• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• A Glance at Graph Theory-Part II
• A note on a problem of Halin's
• A problem concerning infinite graphs
• A problem in infinite graph-theory
• Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• Graph minors. XVII: Taming a vortex
• Graph minors. XX: Wagner's conjecture
• Graph theory with applications
• scientific article; zbMATH DE number 3232673 (Why is no real title available?)
• On a problem of R. Halin concerning infinite graphs
• On a problem of R. Halin concerning infinite graphs. II
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)
• Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen

Cited in

(9)

• On a property of graphs containing infinitely many isomorphic copies of themselves
• Embedding theorems for graphs establishing negative partition relations
• On immersions of uncountable graphs
• On self‐immersions of infinite graphs
• Representing Embeddability as Set Inclusion
• On disjoint configurations in infinite graphs
• Complete graph immersions in dense graphs
• A note on immersion intertwines of infinite graphs
• A weak immersion relation on graphs and its applications

This page was built for publication: On the immersion relation and an embedding problem for infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601389)