Ubiquity of oriented rays
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909272933138432 |
|---|---|
| author | Gut, Florian Krill, Thilo Reich, Florian |
| author_facet | Gut, Florian Krill, Thilo Reich, Florian |
| contents | Call a digraph $H$ \emph{ubiquitous} if every digraph $D$ that contains $k$ vertex-disjoint copies of $H$ for every $k \in \mathbb{N}$ also contains infinitely many vertex-disjoint copies of $H$. We characterise which digraphs whose underlying undirected graph is a ray are ubiquitous. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_06952 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Ubiquity of oriented rays Gut, Florian Krill, Thilo Reich, Florian Combinatorics 05C20, 05C63 Call a digraph $H$ \emph{ubiquitous} if every digraph $D$ that contains $k$ vertex-disjoint copies of $H$ for every $k \in \mathbb{N}$ also contains infinitely many vertex-disjoint copies of $H$. We characterise which digraphs whose underlying undirected graph is a ray are ubiquitous. |
| title | Ubiquity of oriented rays |
| topic | Combinatorics 05C20, 05C63 |
| url | https://arxiv.org/abs/2210.06952 |