{
  "id": "0711.1711",
  "version": "v1",
  "published": "2007-11-12T05:51:51.000Z",
  "updated": "2007-11-12T05:51:51.000Z",
  "title": "Cutsets in infinite graphs",
  "authors": [
    "Adam Timar"
  ],
  "comment": "10 pages",
  "journal": "Published in Combinatorics, Probability and Computing, 16 (2007), issue 1, 159-166",
  "categories": [
    "math.CO",
    "math.GR",
    "math.PR"
  ],
  "abstract": "We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes. The supremum of this number over all minimal cutsets and all partitions is $C_G$. We show that if it is finite for some Cayley graph of the group then it is finite for any (finitely generated) Cayley graph. Having an exponential bound for the number of minimal cutsets of size $n$ separating $o$ from infinity also turns out to be independent of the Cayley graph chosen. We show a 1-ended example (the lamplighter group), where $C_G$ is infinite. Finally, we give a new proof for a question of de la Harpe, proving that the number of $n$-element cutsets separating $o$ from infinity is finite unless $G$ is a finite extension of $Z$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-11-12T05:51:51.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C25",
      "20F65"
    ],
    "keywords": [
      "infinite graphs",
      "minimal cutset",
      "cayley graph chosen",
      "minimal distance",
      "finite extension"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0711.1711T"
    }
  }
}