On the ubiquity of oriented double rays
A digraph \(H\) is called ubiquitous if any digraph \(G\) that contains \(k\) vertex-disjoint copies of \(H\), for every \(k\in \mathbb{N}\), also contains infinitely many vertex-disjoint copies of \(H\) as subdigraphs. Clearly, every finite digraph is ubiquitous. A digraph \(H\) is called an oriented double ray if its underlying undirected graph is a double ray; and a vertex of an oriented double ray is called a turn if it has in-degree or out-degree 2. In this paper, the authors show that an oriented double ray with at least one turn is ubiquitous if and only if it has a (finite) odd number of turns.
- Classes of locally finite ubiquitous graphs
- Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
- Edge-disjoint double rays in infinite graphs: a Halin type result
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- On disjoint configurations in infinite graphs
- Topological ubiquity of trees
- Ubiquity of graphs with nowhere‐linear end structure
- Ubiquity of locally finite graphs with extensive tree-decompositions
- Ubiquity of oriented rays
- Über die Maximalzahl fremder unendlicher Wege in Graphen
This page was built for publication: On the ubiquity of oriented double rays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988424)
