An edge or face of an embedded graph is light if the sum of the degree
s of the vertices incident with it is small. This paper parallelizes f
our inequalities on the number of light edges and light triangles from
the plane to the projective plane. Each of the four inequalities is s
hown to be the best possible. (C) 1996 John Wiley & Sons, Inc.