{
  "id": "1203.0855",
  "version": "v1",
  "published": "2012-03-05T10:39:20.000Z",
  "updated": "2012-03-05T10:39:20.000Z",
  "title": "Lower bound on the number of the maximum genus embedding of $K_{n,n}$",
  "authors": [
    "Guanghua Dong",
    "Han Ren",
    "Ning Wang",
    "Yuanqiu Huang"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-03-05T10:39:20.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "lower bound",
      "complete bipartite graph kn",
      "distinct maximum genus embedding",
      "odd number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1203.0855D"
    }
  }
}