English

A Note On Immersion Intertwines Of Infinite Graphs

Combinatorics 2015-08-24 v1

Abstract

We present a construction of two infinite graphs G1G_1 and G2G_2, and of an infinite set F\mathscr{F} of graphs such that F\mathscr{F} is an antichain with respect to the immersion relation and, for each graph GG in F\mathscr{F}, both G1G_1 and G2G_2 are subgraphs of GG, but no graph properly immersed in GG admits an immersion of G1G_1 and of G2G_2. This shows that the class of infinite graphs ordered by the immersion relation does not have the finite intertwine property.

Keywords

Cite

@article{arxiv.1508.05378,
  title  = {A Note On Immersion Intertwines Of Infinite Graphs},
  author = {Matthew Barnes and Bogdan Oporowski},
  journal= {arXiv preprint arXiv:1508.05378},
  year   = {2015}
}
R2 v1 2026-06-22T10:39:05.433Z