Lucas Colucci

collaborators

4 papers

math.CO2026

On a problem of Caro on $Z_{3}$ -Ramsey number of forests

JosÃ© D. Alvarado, Lucas Colucci, Roberto Parente

Let $k$ be a positive integer and let $G$ be a graph. The zero-sum Ramsey number $R (G, Z_{k})$ is the least integer $N$ (if it exists) such that for every edge-coloring $Ï\,…

math.CO2026

On converse invariant trees of diameter four

Fernando Afonso, Lucas Colucci, TÃ¡ssio Naia

Let $D$ be an oriented graph, and let $f_{T} (D)$ denote the number of copies of $D$ in a tournament $T$ . We say that $D$ is \emph{converse invariant} if $f_{T} (D) = f_{T} (D)$ for…

math.CO2026

A linear upper bound on the zero-sum Ramsey number of forests in $Z_{p}$

Lucas Colucci, Marco D'Emidio

Let $m$ be a positive integer and let $G$ be a graph. The zero-sum Ramsey number $R (G, Z_{m})$ is the least integer $N$ (if it exists) such that for every edge-coloring $Ï\,…

math.CO2025

On Modular Edge Colourings of Graphs

Given a graph $G$ and an integer $k \geq 2$ , let $I ¨ _{k}^{'} (G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in each colour class, the subgraph in…

On a problem of Caro on Z3​-Ramsey number of forests

On converse invariant trees of diameter four

A linear upper bound on the zero-sum Ramsey number of forests in Zp​

On Modular Edge Colourings of Graphs

On a problem of Caro on $Z_{3}$ -Ramsey number of forests

A linear upper bound on the zero-sum Ramsey number of forests in $Z_{p}$