English

Towards Nash-Williams Orientation Conjecture for Infinite Graphs

Combinatorics 2024-08-29 v3

Abstract

In 1960 Nash-Williams proved that an edge-connectivity of 2k is sufficient for a finite graph to have a k-arc-connected orientation. He then conjectured that the same is true for infinite graphs. In 2016, Thomassen, using his own results on the auxiliary lifting graph, proved that 8k-edge-connected infinite graphs admit a kk-arc connected orientation. Here we improve this result for the class of 11-ended locally-finite graphs and show that an edge-connectivity of 4k is enough in that case. Crucial to this improvement are results presented in a separate paper, by the same author of this paper, on the key concept of the lifting graph, extending results by Ok, Richter, and Thomassen.

Keywords

Cite

@article{arxiv.2306.10631,
  title  = {Towards Nash-Williams Orientation Conjecture for Infinite Graphs},
  author = {Amena Assem},
  journal= {arXiv preprint arXiv:2306.10631},
  year   = {2024}
}

Comments

to appear in Journal of Graph Theory

R2 v1 2026-06-28T11:08:20.890Z