 Therefore, this graph can be embedded as a Whitney triangulation of a torus, in which every face is a triangle and every triangle is a face.More generally, if any Paley graph of order "q" could be embedded so that all its faces are triangles, we could calculate the genus of the resulting surface via the Euler characteristic as formula_8.conjectures that the minimum genus of a surface into which a Paley graph can be embedded is near this bound in the case that "q" is a square, and questions whether such a bound might hold more generally.