\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
we show that for every j > 0,
there exists n0 such that for every even n, n > n0, and every graph G with (2+j)n vertices and the minimum degree at least (7/4 + 4j)n, each colouring of the edges of G with three colours results in a monochromatic cycle of length n.
\end{document}