Ramsey properties of randomly perturbed graphs: cliques and cycles

19 Mar 2020 Das Shagnik Treglown Andrew

Given graphs $H_1,H_2$, a graph $G$ is $(H_1,H_2)$-Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_1$ or a blue copy of $H_2$. In this paper we investigate Ramsey questions in the setting of randomly perturbed graphs: this is a random graph model introduced by Bohman, Frieze and Martin in which one starts with a dense graph and then adds a given number of random edges to it... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS