4 papers
On Modular Edge Colourings of Graphs
Gaétan Berthe, Marthe Bonamy, Fábio Botler +5
Given a graph and an integer , let denote the minimum number of colours required to colour the edges of such that, in each colour class, the subgraph in…
On the Modular Chromatic Index of Random Hypergraphs
Gaia Carenini, Samuel Coulomb
Let be two integers. We consider the problem of partitioning the hyperedge set of an -uniform hypergraph into the minimum number of edge-disjoint sub…
Property Testing in Bounded Degree Hypergraphs
Hugo Aaronson, Gaia Carenini, Atreyi Chanda
We extend the bounded degree graph model for property testing introduced by Goldreich and Ron (Algorithmica, 2002) to hypergraphs. In this framework, we analyse the query complexit…
Towards a Fully Interpretable and More Scalable RSA Model for Metaphor Understanding
Gaia Carenini, Luca Bischetti, Walter Schaeken +1
The Rational Speech Act (RSA) model provides a flexible framework to model pragmatic reasoning in computational terms. However, state-of-the-art RSA models are still fairly distant…