{
  "id": "math/0205231",
  "version": "v1",
  "published": "2002-05-22T17:28:02.000Z",
  "updated": "2002-05-22T17:28:02.000Z",
  "title": "Intrinsic knotting and linking of complete graphs",
  "authors": [
    "Erica Flapan"
  ],
  "comment": "Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol2/agt-2-17.abs.html",
  "journal": "Algebr. Geom. Topol. 2 (2002) 371-380",
  "categories": [
    "math.GT"
  ],
  "abstract": "We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every embedding of K_r in R^3 contains a knot Q with |a_2(Q)| > m-1, where a_2(Q) denotes the second coefficient of the Conway polynomial of Q.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-05-22T17:28:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25",
      "05C10"
    ],
    "keywords": [
      "complete graph",
      "intrinsic knotting",
      "second coefficient",
      "conway polynomial"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}