\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
We show that in every 3-coloring of the edges of a graph G of order N such that Î´(G) ï¿½?ï¿½5N/6ï¿½??1, there is a monochromatic component of order at least N/2. We also show that this result is best possible.
\end{document}