{
  "id": "1008.2638",
  "version": "v1",
  "published": "2010-08-16T12:44:02.000Z",
  "updated": "2010-08-16T12:44:02.000Z",
  "title": "On the Orchard crossing number of complete bipartite graphs",
  "authors": [
    "Elie Feder",
    "David Garber"
  ],
  "comment": "23 pages, 4 figures; Submitted",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-08-16T12:44:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C62"
    ],
    "keywords": [
      "complete bipartite graphs",
      "orchard crossing number",
      "similar way",
      "rectilinear crossing number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 23,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1008.2638F"
    }
  }
}