The strong Nash-Williams orientation theorem for rayless graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912030673338368 |
|---|---|
| author | Pitz, Max Stegemann, Jacob |
| author_facet | Pitz, Max Stegemann, Jacob |
| contents | In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded down). Nash-Williams conjectured that it is possible to find such orientations for infinite graphs as well. We provide a partial answer by proving that all rayless graphs have such an orientation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_10378 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The strong Nash-Williams orientation theorem for rayless graphs Pitz, Max Stegemann, Jacob Combinatorics In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded down). Nash-Williams conjectured that it is possible to find such orientations for infinite graphs as well. We provide a partial answer by proving that all rayless graphs have such an orientation. |
| title | The strong Nash-Williams orientation theorem for rayless graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.10378 |