On ubiquity problems in infinite digraphs
Combinatorics
2026-02-27 v1
Abstract
We prove that the consistently oriented double ray is ubiquitous if and only if it is ubiquitous restricted to the class of one-ended digraphs. Additionally, we prove the same equivalence for the disjoint union of a consistently forward and a consistently backward oriented ray. Furthermore, we discuss the connection between these two ubiquity problems.
Cite
@article{arxiv.2602.22912,
title = {On ubiquity problems in infinite digraphs},
author = {Matthias Hamann and Karl Heuer},
journal= {arXiv preprint arXiv:2602.22912},
year = {2026}
}
Comments
14 pages, 1 figure