3 papers
math.CO2026
Edge-ends versus topological ends of graphs
Leandro Aurichi, Paulo Magalhães Júnior, Guilherme Eduardo Pinto
Diestel and Kühn proved that the topological ends of an infinite graph are precisely its undominated graph ends, yielding a canonical embedding of the space of topological ends int…
math.CO2025
Universal families of rayless graphs
Leandro Fiorini Aurichi, Guilherme Eduardo Pinto
We study the existence and cardinality of universal families for classes of rayless graphs. It is known, by a result of Diestel, Halin, and Vogler, that the class of countable rayl…
math.CO2025
On orientations preserving edge-connectivity in infinite graphs
Leandro Aurichi, Paulo Magalhães Júnior, Guilherme Eduardo Pinto
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…