New lower bounds on the size-Ramsey number of a path

Deepak Bal, Louis DeBiasio

We prove that for all graphs with at most $(3.75-o(1))n$ edges there exists a 2-coloring of the edges such that every monochromatic path has order less than $n$. This was previousl…