{
  "id": "math/0409323",
  "version": "v1",
  "published": "2004-09-18T18:46:56.000Z",
  "updated": "2004-09-18T18:46:56.000Z",
  "title": "A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees",
  "authors": [
    "Seunghyun Seo"
  ],
  "comment": "9 pages, 3 figures (use PSTricks)",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-09-18T18:46:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "05C05",
      "05C30"
    ],
    "keywords": [
      "labeled trees",
      "postnikovs identity",
      "combinatorial proof",
      "generalized enumeration",
      "simple combinatorial explanation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......9323S"
    }
  }
}