 As of 2013, this conjecture remains unsolved.It is also known as Negami's "1-2-∞ conjecture", because it can be reformulated as stating that the minimum ply of a planar cover, if it exists, must be either 1 or 2.Like the graphs with planar covers, the graphs with projective plane embeddings can be characterized by forbidden minors.