Domenico Mergoni Cecchelli

most citedDensity of small diameter subgraphs in

K_{r}

-free graphs

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

collaborators

2 papers

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★ 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…

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

Density of small diameter subgraphs in Kr​-free graphs

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

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