On orientations preserving edge-connectivity in infinite graphs
Abstract
Abstract We prove that every $2k$-edge-connected graph with countably many edge-ends admits a $k$-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite. We prove that, if every locally finite graph has a well-balanced orientation, so does every graph. Lastly, we explore an alternative to the Nash-Williams Orientation Conjecture via topological paths, and prove that it is true for every finitely separable graph.
Fields of Study & Subjects
Advanced Graph Theory Research
Interconnection Networks and Systems
Computational Geometry and Mesh Generation
Publication details
- Journal / source
- Journal of Logic and Computation
- Volume
- 36
- Issue
- 5
- Publication date
- 30 May 2026
- Language
- EN