A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs (Q2469983): Difference between revisions

The authors prove that there are exponentially many nonisomorphic face 3-colorable nonorientable triangular embeddings of the complete graph \(K_n\), where \(n= (12s+ 7)(6s+ 7)\) with any integer \(s\) such that \(12s+ 7\) is prime. The proof combines a cut-and-paste technique and the index one current graph technique both used in earlier papers (resp. see \textit{M.J. Grannell}, \textit{T.S. Griggs}, and \textit{J. Širáň} [J. Graph Theory 39, 87--107 (2002; Zbl 0999.05021)] and \textit{V.P. Korzhik} and \textit{H.-J. Voss} [J. Comb. Theory, Ser. B 91, 253--287 (2004; Zbl 1048.05031)]). Furthermore a new connection between such embeddings and Steiner triple systems is given.