  We examine graphs that contain a non-trivial link in every embedding into
real projective space, using a weaker notion of unlink than was used by Flapan,
et al. We call such graphs intrinsically linked in projective space. We fully
characterize such graphs with connectivity 0,1 and 2. We also show that only
one Petersen-family graph is intrinsically linked in projective space and prove
that K7 minus any two edges is also minor-minimal intrinsically linked. In all,
594 graphs are shown to be minor-minimal intrinsically linked in projective
space.
