62 coaches online • Server time: 15:44
If a finite, connected, planar graph is drawn in the plane without any edge intersections, and v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer, infinitely-large region), then v - e + f = 2
Such a useless, useless bastard. Did nothing. In 15 games. Couldn't even do the honourable thing and die and so wobbled around complaining about his trapped nerves.