A Lower Bound for the Ramsey Multiplicity of \(K_4\)

The Ramsey multiplicity \(R(G)\) of a graph \(G\) is defined as the smallest number of monochromatic copies of \(G\) in any two-coloring of the edges of \(K_r(q)\), where \(r(G)\) is the Ramsey number of \(G\). Here, we prove that \(R(K_4) \geq 4\).