On the genus of the complete tripartite graph $K_{n,n,1}$

Valentas Kurauskas

For even $n$ we prove that the genus of the complete tripartite graph $K_{n,n,1}$ is $\lceil (n-1)(n-2)/4\rceil$. This is the least number of bridges needed to build a complete $…