{
  "id": "math/0403339",
  "version": "v1",
  "published": "2004-03-21T21:11:28.000Z",
  "updated": "2004-03-21T21:11:28.000Z",
  "title": "The enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors",
  "authors": [
    "Peter Zograf"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Following Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of arbitrary length in graphs (in particular, Hamiltonian cycles).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-03-21T21:11:28.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hamiltonian cycles",
      "symmetric tensors",
      "enumeration",
      "functions enumerate edge colorings",
      "graph functions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......3339Z"
    }
  }
}