A Note On Immersion Intertwines Of Infinite Graphs
Combinatorics
2015-08-24 v1
Abstract
We present a construction of two infinite graphs and , and of an infinite set of graphs such that is an antichain with respect to the immersion relation and, for each graph in , both and are subgraphs of , but no graph properly immersed in admits an immersion of and of . 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}
}