{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:49:49Z","timestamp":1782236989509,"version":"3.54.5"},"reference-count":15,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,6,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1093\/logcom\/exag028","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T11:43:20Z","timestamp":1780141400000},"source":"Crossref","is-referenced-by-count":0,"title":["On orientations preserving edge-connectivity in infinite graphs"],"prefix":"10.1093","volume":"36","author":[{"given":"Leandro","family":"Aurichi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Universidade de S\u00e3o Paulo, Instituto Matem\u00e1ticas de Ci\u00eancias e de Computa\u00e7\u00e3o , S\u00e3o Carlos, SP 13566-590 ,","place":["Brazil"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"Jr.","given":"Paulo","family":"Magalh\u00e3es","sequence":"additional","affiliation":[{"name":"Instituto Federal do Rio Grande do Norte , Campus Currais Novos, Currais Novos, RN 59380-000 ,","place":["Brazil"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guilherme","family":"Eduardo Pinto","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Universidade de S\u00e3o Paulo, Instituto de Ci\u00eancias Matem\u00e1ticas e Computa\u00e7\u00e3o , S\u00e3o Carlos, SP 13566-590 ,","place":["Brazil"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,6,23]]},"reference":[{"key":"2026062313205248900_ref1","doi-asserted-by":"crossref","first-page":"104043","DOI":"10.1016\/j.ejc.2024.104043","article-title":"The Nash-Williams orientation theorem for graphs with countably many ends","volume":"124","author":"Assem","year":"2025","journal-title":"European Journal of Combinatorics"},{"key":"2026062313205248900_ref2","doi-asserted-by":"crossref","first-page":"114724","DOI":"10.1016\/j.disc.2025.114724","article-title":"Limits of cycles and cover conjectures","volume":"349","author":"Aurichi","year":"2026","journal-title":"Discrete Mathematics"},{"key":"2026062313205248900_ref3","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.disc.2010.06.007","article-title":"What is on his mind?","volume":"310","author":"Bar\u00e1t","year":"2010","journal-title":"Discrete Mathematics"},{"key":"2026062313205248900_ref4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ejc.2003.01.002","article-title":"Topological paths, cycles and spanning trees in infinite graphs","volume":"25","author":"Diestel","year":"2004","journal-title":"European Journal of Combinatorics"},{"key":"2026062313205248900_ref5","first-page":"505","article-title":"\u00dcber die wohlgerichteten unendlichen Graphen","volume":"48","author":"Egyed","year":"1941","journal-title":"Matematikai \u00e9s Physikai Lapok"},{"key":"2026062313205248900_ref6","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1016\/j.disc.2011.02.012","article-title":"Graph topologies induced by edge lengths","volume":"311","author":"Georgakopoulos","year":"2011","journal-title":"Discrete Mathematics"},{"key":"2026062313205248900_ref7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jctb.1996.1734","article-title":"Edge-ends in countable graphs","volume":"70","author":"Hahn","year":"1997","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2026062313205248900_ref8","volume-title":"Eine Topologische Erweiterung Des Orientierungs-Theorems von Nash-Williams Auf Lokal Endliche Graphe","author":"Jannasch","year":"2019"},{"key":"2026062313205248900_ref9","volume-title":"Set Theory: An Introduction to Independence Proofs","author":"Kunen","year":"1980"},{"key":"2026062313205248900_ref10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.jctb.2005.01.003","article-title":"Decompositions of infinite graphs: I\u2014Bond-faithful decompositions","volume":"94","author":"Laviolette","year":"2005","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2026062313205248900_ref11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd-vertex-pairings in finite graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Canadian Journal of Mathematics"},{"key":"2026062313205248900_ref12","author":"Pitz","year":"2024"},{"key":"2026062313205248900_ref13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs, with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"The American Mathematical Monthly"},{"key":"2026062313205248900_ref14","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1111\/j.1749-6632.1989.tb22479.x","article-title":"Configurations in graphs of large minimum degree, connectivity, or chromatic number","volume":"555","author":"Thomassen","year":"1989","journal-title":"Annals of the New York Academy of Sciences"},{"key":"2026062313205248900_ref15","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s00493-015-3173-0","article-title":"Orientations of infinite graphs with prescribed edge-connectivity","volume":"36","author":"Thomassen","year":"2016","journal-title":"Combinatorica"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/5\/exag028\/68586467\/exag028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/5\/exag028\/68586467\/exag028.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:20:59Z","timestamp":1782235259000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exag028\/8714135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,6,18]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exag028","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,7]]},"published":{"date-parts":[[2026,6,18]]},"article-number":"exag028"}}