1 citations · 3 across the 9 of their papers we have counts for
6 papers · 1 filter
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…
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 . This…
On product Schur triples in the integers
Letícia Mattos, Domenico Mergoni Cecchelli, Olaf Parczyk
Schur's theorem states that in any -colouring of the set of integers there is a monochromatic solution to , provided is sufficiently large. Abbott and Wang stud…
Graphs with large minimum degree and no small odd cycles are -colourable
Julia Böttcher, Nóra Frankl, Domenico Mergoni Cecchelli +2
Answering a question by Letzter and Snyder, we prove that for large enough any -vertex graph with minimum degree at least and without odd cycles of len…
The Ramsey numbers of squares of paths and cycles
Peter Allen, Domenico Mergoni Cecchelli, Barnaby Roberts +1
The square of a graph is the graph on with a pair of vertices an edge whenever and have distance or in . Given graphs and , the Rams…
Density of small diameter subgraphs in -free graphs
Eng Keat Hng, Domenico Mergoni Cecchelli
We denote by the maximum number of copies of in an -vertex graph that does not contain as a subgraph. Recently, Grzesik, Győri, Salia, Tompkins cons…