On orientations preserving edge-connectivity in infinite graphs
Journal of Logic and Computation · 18.06.2026 · 36 (5)
DOI: 10.1093/logcom/exag028 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 23.06.2026. Verfasst von Leandro Aurichi und 2 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Aurichi, L., Magalhães, P., & Pinto, G. E. (2026). On orientations preserving edge-connectivity in infinite graphs. Journal of Logic and Computation, 36(5). https://doi.org/10.1093/logcom/exag028
Vancouver
Aurichi L, Magalhães P, Pinto GE. On orientations preserving edge-connectivity in infinite graphs. Journal of Logic and Computation. 2026;36(5). doi:10.1093/logcom/exag028
BibTeX
@article{Aurichi2026,
author = {Aurichi, Leandro and Magalhães, Paulo and Pinto, Guilherme Eduardo},
title = {On orientations preserving edge-connectivity in infinite graphs},
journal = {Journal of Logic and Computation},
year = {2026},
volume = {36},
number = {5},
doi = {10.1093/logcom/exag028}
}
EUVIMED