arXiv Analytics

Sign in

arXiv:1203.0855 [math.CO]AbstractReferencesReviewsResources

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

Guanghua Dong, Han Ren, Ning Wang, Yuanqiu Huang

Published 2012-03-05Version 1

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.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1309.3625 [math.CO] (Published 2013-09-14, updated 2014-03-14)
A Lower Bound on the Crossing Number of Uniform Hypergraphs
arXiv:0809.2282 [math.CO] (Published 2008-09-12, updated 2015-05-31)
New lower bounds for the number of blocks in balanced incomplete block designs
arXiv:1111.0587 [math.CO] (Published 2011-11-02)
Structures and lower bounds for binary covering arrays

Links

Toolbox