{
  "id": "1505.02980",
  "version": "v1",
  "published": "2015-05-12T12:34:43.000Z",
  "updated": "2015-05-12T12:34:43.000Z",
  "title": "11-colored knot diagram with five colors",
  "authors": [
    "Takuji Nakamura",
    "Yasutaka Nakanishi",
    "Shin Satoh"
  ],
  "comment": "20 pages, 27 figures. Submitted",
  "categories": [
    "math.GT"
  ],
  "abstract": "We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also prove a similar result for any $11$-colorable ribbon $2$-knot.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-05-12T12:34:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25",
      "57Q45"
    ],
    "keywords": [
      "knot diagram",
      "colored diagram",
      "similar result"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150502980N"
    }
  }
}