EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Strong Nash‐Williams Orientation Theorem for Rayless Graphs

Max Pitz, Jacob Stegemann

Journal of Graph Theory · 23.07.2026

DOI: 10.1002/jgt.70100 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 23.07.2026. Verfasst von Max Pitz und 1 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint 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.

Zitieren

APA

Pitz, M., & Stegemann, J. (2026). The Strong Nash‐Williams Orientation Theorem for Rayless Graphs. Journal of Graph Theory. https://doi.org/10.1002/jgt.70100

Vancouver

Pitz M, Stegemann J. The Strong Nash‐Williams Orientation Theorem for Rayless Graphs. Journal of Graph Theory. 2026. doi:10.1002/jgt.70100

BibTeX
@article{Pitz2026,
  author = {Pitz, Max and Stegemann, Jacob},
  title = {The Strong Nash‐Williams Orientation Theorem for Rayless Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  doi = {10.1002/jgt.70100}
}
Kostenlos starten →