{
  "id": "1210.6380",
  "version": "v1",
  "published": "2012-10-23T21:06:29.000Z",
  "updated": "2012-10-23T21:06:29.000Z",
  "title": "Matroid and Tutte-connectivity in infinite graphs",
  "authors": [
    "Henning Bruhn"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity function. As an application we re-prove that, also for infinite graphs, Tutte-connectivity is invariant under taking dual graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-10-23T21:06:29.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "infinite graph",
      "tutte-connectivity",
      "relate matroid connectivity",
      "connectivity function",
      "dual graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1210.6380B"
    }
  }
}