pith. sign in

arxiv: 1508.05378 · v1 · pith:IZLE4Z4Jnew · submitted 2015-08-21 · 🧮 math.CO

A Note On Immersion Intertwines Of Infinite Graphs

classification 🧮 math.CO
keywords graphsimmersioninfinitemathscrgraphrelationadmitsantichain
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.