Normal trees of digraphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915344527917056 |
|---|---|
| author | Reich, Florian |
| author_facet | Reich, Florian |
| contents | In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space $|D|$ is metrizable, which generalises Diestel's result for undirected graphs. Furthermore, we show that the existence of normal arborescences implies the existence of normal trees in directed graphs, and that the converse is generally not true. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_02624 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Normal trees of digraphs Reich, Florian Combinatorics 05C20, 05C63 In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space $|D|$ is metrizable, which generalises Diestel's result for undirected graphs. Furthermore, we show that the existence of normal arborescences implies the existence of normal trees in directed graphs, and that the converse is generally not true. |
| title | Normal trees of digraphs |
| topic | Combinatorics 05C20, 05C63 |
| url | https://arxiv.org/abs/2410.02624 |