{
  "id": "math/0512392",
  "version": "v2",
  "published": "2005-12-16T14:32:03.000Z",
  "updated": "2006-06-19T12:26:43.000Z",
  "title": "A linear upper bound on the rectilinear crossing number",
  "authors": [
    "David R. Wood"
  ],
  "comment": "This paper has been withdrawn by the author. The results have been superseeded by the author's paper with Jan Arne Telle: \"Planar decompositions and the crossing number of graphs with an excluded minor\", http://arxiv.org/math/0604467",
  "categories": [
    "math.CO"
  ],
  "abstract": "It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the author's paper with Jan Arne Telle: \"Planar decompositions and the crossing number of graphs with an excluded minor\", http://arxiv.org/math/0604467.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2006-06-19T12:26:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10"
    ],
    "keywords": [
      "rectilinear crossing number",
      "linear upper bound",
      "jan arne telle",
      "authors paper",
      "planar decompositions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math.....12392W"
    }
  }
}