{
  "id": "math/0511133",
  "version": "v1",
  "published": "2005-11-05T16:01:50.000Z",
  "updated": "2005-11-05T16:01:50.000Z",
  "title": "Intrinsically linked graphs and even linking number",
  "authors": [
    "Thomas Fleming",
    "Alexander Diesl"
  ],
  "comment": "Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-55.abs.html",
  "journal": "Algebr. Geom. Topol. 5 (2005) 1419-1432",
  "categories": [
    "math.GT"
  ],
  "abstract": "We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all linking numbers are even, or an n-component link with components L, A_i where lk(L,A_i) = 3k, k not 0. Links with other properties are considered as well. For a given property, we prove that every embedding of a certain complete graph contains a link with that property. The size of the complete graph is determined by the property in question.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-11-05T16:01:50.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M15",
      "57M25",
      "05C10"
    ],
    "keywords": [
      "linking number",
      "complete graph contains",
      "non-split n-component link",
      "study intrinsically linked graphs",
      "non-split link"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}