Lucas Colucci

activity

20132026

most citedEdge colorings of graphs without monochromatic stars

5 citations · 12 across the 13 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

math.CO2025

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

Gaétan Berthe, Marthe Bonamy, Fábio Botler +5

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

math.CO2025

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 $χ\,…

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 Z3​-Ramsey number of forests

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

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