1 problem

Dudek–La Fleur–Mubayi–Rödl's conjecture. The size-Ramsey number of tight paths is linear in the number of vertices $n$, that is, for each fixed $k$, there is a constant $C_k$ such…