Gaia Carenini

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

On the Modular Chromatic Index of Random Hypergraphs

Gaia Carenini, Samuel Coulomb

Let $k, r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$ -uniform hypergraph $H$ into the minimum number $χ_{k}^{'} (H)$ of edge-disjoint subh…

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…