A Note On Immersion Intertwines Of Infinite Graphs
Abstract
We present a construction of two infinite graphs G1 and G2, and of an infinite set F of graphs such that F is an antichain with respect to the immersion relation and, for each graph G in F, both G1 and G2 are subgraphs of G, but no graph properly immersed in G admits an immersion of G1 and of G2. This shows that the class of infinite graphs ordered by the immersion relation does not have the finite intertwine property.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.