{
  "id": "0807.4450",
  "version": "v1",
  "published": "2008-07-28T13:39:54.000Z",
  "updated": "2008-07-28T13:39:54.000Z",
  "title": "Candy-passing Games on General Graphs, I",
  "authors": [
    "Paul M. Kominers",
    "Scott D. Kominers"
  ],
  "comment": "2 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0709.2156) for candy-passing games on n-cycles with at least 3n candies.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-07-28T13:39:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35",
      "37B15"
    ],
    "keywords": [
      "candy-passing game",
      "general graphs",
      "first authors results",
      "general stabilization result",
      "3n candies"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 2,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0807.4450K"
    }
  }
}