{
  "id": "1501.03758",
  "version": "v1",
  "published": "2015-01-15T17:42:26.000Z",
  "updated": "2015-01-15T17:42:26.000Z",
  "title": "Polynomial representation for the expected length of minimal spanning trees",
  "authors": [
    "Jared Nishikawa",
    "Peter T. Otto",
    "Colin Starr"
  ],
  "comment": "Published in the PME Journal in 2012",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and apply it to express the first few coefficients in terms of the structure of the underlying graph; e.g. number of vertices, edges and cycles.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-01-15T17:42:26.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60C05",
      "05C31"
    ],
    "keywords": [
      "minimal spanning tree",
      "expected length",
      "polynomial representation",
      "general formula",
      "integral formula"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}