Domenico Mergoni Cecchelli

activity

20222026

most citedGraphs with large minimum degree and no small odd cycles are

3

-colourable

1 citations · 3 across the 9 of their papers we have counts for

collaborators

9 papers

cs.GT2026

Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games

Giulio Salizzoni, Domenico Mergoni Cecchelli, Edward Plumb +2

While infinitely repeated games admit a rich set of Nash equilibria, finitely repeated games typically have a much smaller and often inefficient one. We show how to enlarge this se…

math.CO2026

A generalised transference principle

Peter Allen, Julia Böttcher, Joanna Lada +1

The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by…

cs.GT2025

Simultaneous Best-Response Dynamics in Random Potential Games

Galit Ashkenazi-Golan, Domenico Mergoni Cecchelli, Edward Plumb

This paper examines the convergence behaviour of simultaneous best-response dynamics in random potential games. We provide a theoretical result showing that, for two-player games w…

cs.GT2024

The Bounds of Algorithmic Collusion; $Q$ -learning, Gradient Learning, and the Folk Theorem

Galit Askenazi-Golan, Domenico Mergoni Cecchelli, Edward Plumb +1

We explore the behaviour emerging from learning agents repeatedly interacting strategically for a wide range of learning dynamics, including $Q$ -learning, projected gradient, repli…

math.CO2024

Dirac's theorem for graphs of bounded bandwidth

Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli +2

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2, ℓ}$ . This…

math.CO2023★ 1 cited

On product Schur triples in the integers

Letícia Mattos, Domenico Mergoni Cecchelli, Olaf Parczyk

Schur's theorem states that in any $k$ -colouring of the set of integers $[n]$ there is a monochromatic solution to $a + b = c$ , provided $n$ is sufficiently large. Abbott and Wang stud…

math.CO2023★ 1 cited

Graphs with large minimum degree and no small odd cycles are $3$ -colourable

Julia Böttcher, Nóra Frankl, Domenico Mergoni Cecchelli +2

Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$ -vertex graph $G$ with minimum degree at least $\frac{1}{2 k - 1} n$ and without odd cycles of len…

math.CO2022

The Ramsey numbers of squares of paths and cycles

Peter Allen, Domenico Mergoni Cecchelli, Barnaby Roberts +1

The square $G^{2}$ of a graph $G$ is the graph on $V (G)$ with a pair of vertices $uv$ an edge whenever $u$ and $v$ have distance $1$ or $2$ in $G$ . Given graphs $G$ and $H$ , the Rams…

math.CO2022★ 1 cited

Density of small diameter subgraphs in $K_{r}$ -free graphs

Eng Keat Hng, Domenico Mergoni Cecchelli

We denote by $ex (n, H, F)$ the maximum number of copies of $H$ in an $n$ -vertex graph that does not contain $F$ as a subgraph. Recently, Grzesik, Győri, Salia, Tompkins cons…