23 citations · 43 across the 25 of their papers we have counts for
30 papers
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
The linear arboricity $\la(G)$ of a graph is the least cardinality of linear forests, that is, forests of maximum degree at most , into which its edge set can be deco…
Kriesell's conjecture for infinite graphs
Leandro Aurichi, Paulo Magalhães Júnior, Rodrigo Santos Monteiro
Let be a graph and be a subset of vertices. An -Steiner tree of is a tree of which contains in its vertex set . Kriesell conjectured…
A topological characterization of end space of infinite graphs via games, subspaces and products
Leandro Aurichi, Gustavo Boska, Davide Giacopello +1
In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological char…
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…
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…
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…