Rodrigo Santos Monteiro

activity

20242026

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Linear arboricity conjecture for infinite graphs

Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues

The linear arboricity $\la(G)$ of a graph $G$ is the least cardinality of linear forests, that is, forests of maximum degree at most $2$ , into which its edge set $E (G)$ can be deco…

math.CO2026

Kriesell's conjecture for infinite graphs

Leandro Aurichi, Paulo Magalhães Júnior, Rodrigo Santos Monteiro

Let $G$ be a graph and $S \subseteq V (G)$ be a subset of vertices. An $S$ -Steiner tree $T$ of $G$ is a tree of $G$ which contains $S$ in its vertex set $V (T)$ . Kriesell conjectured…

math.CO2025

On convergence structures in graphs

Paulo Magalhães Junior, Renan Maneli Mezabarba, Rodrigo Santos Monteiro

A closure operator on a set $X$ is a function $cl : ℘ (X) \to ℘ (X)$ satisfying, for all $A, B \subseteq X$ , the following properties: extensivity, $A \subseteq \op…