K1,2,2,2 has no n-fold planar cover graph for n<14
Abstract
S. Negami conjectured in 1988 that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the works of D. Archdeacon, M. Fellows, P. Hlinen\'y, and S. Negami that this conjecture is true if the graph K1, 2, 2, 2 has no finite planar cover. We prove a number of structural results about putative finite planar covers of K1,2,2,2 that may be of independent interest. We then apply these results to prove that K1, 2, 2, 2 has no planar cover of fold number less than 14.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.