Lower bound on the number of the maximum genus embedding of $K_{n,n}$

Guanghua Dong; Han Ren; Ning Wang; Yuanqiu Huang

arxiv: 1203.0855 · v1 · pith:QVKIHSWLnew · submitted 2012-03-05 · 🧮 math.CO

Lower bound on the number of the maximum genus embedding of K_(n,n)

Guanghua Dong , Han Ren , Ning Wang , Yuanqiu Huang This is my paper

classification 🧮 math.CO

keywords numberboundembeddinggenuslowermaximumbipartitecomplete

0 comments

read the original abstract

In this paper, we provide an method to obtain the lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n be an odd number), which, in some sense, improves the results of S. Stahl and H. Ren.

This paper has not been read by Pith yet.

Lower bound on the number of the maximum genus embedding of K_(n,n)

discussion (0)