arXiv Open Access 2025

On orientations preserving edge-connectivity in infinite graphs

Leandro Aurichi Paulo Magalhães Júnior Guilherme Eduardo Pinto

Lihat Sumber

Abstrak

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 separated graph.

Topik & Kata Kunci

math.CO math.GN

Penulis (3)

Leandro Aurichi

Paulo Magalhães Júnior

Guilherme Eduardo Pinto

Format Sitasi

APA MLA BibTeX

Aurichi, L., Júnior, P.M., Pinto, G.E. (2025). On orientations preserving edge-connectivity in infinite graphs. https://arxiv.org/abs/2510.06449

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓