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

Showing 2023Show all

2 papers · 1 filter

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…

On product Schur triples in the integers

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

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