{
  "id": "0907.5138",
  "version": "v2",
  "published": "2009-07-29T14:09:22.000Z",
  "updated": "2010-10-29T15:51:59.000Z",
  "title": "Cutwidth and degeneracy of graphs",
  "authors": [
    "Benoit Kloeckner"
  ],
  "comment": "v2: slightly shortened, some typos corrected.",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2010-10-29T15:51:59.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "degeneracy",
      "quadratic lower bound",
      "clique-free graphs",
      "inequality"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0907.5138K"
    }
  }
}