3 problems

For $r\geq2$ and $\delta\in(0,1/2)$, let … where $\mathcal{G}(n,r,\delta)$ consists of the $n$-vertex $r$-edge-coloured graphs with $\delta(G)\geq(1-\delta)n$, and $cp(G)$ is the s…

Exact cycle-partition conjecture. There exists an integer $n_0$ such that, whenever $n\geq n_0$ and

Balogh–Barát–Gerbner–Gyárfás–Sárközy conjecture. If