{
  "id": "1709.07466",
  "version": "v1",
  "published": "2017-09-21T18:10:31.000Z",
  "updated": "2017-09-21T18:10:31.000Z",
  "title": "The 6-girth-thickness of the complete graph",
  "authors": [
    "Héctor Castañeda-López",
    "Pablo C. Palomino",
    "Andrea B. Ramos-Tort",
    "Christian Rubio-Montiel",
    "Claudia Silva-Ruíz"
  ],
  "comment": "10 pages, 8 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "The $g$-girth-thickness $\\theta(g,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we determine the $6$-girth-thickness $\\theta(6,K_n)$ of the complete graph $K_n$ in almost all cases. And also, we calculate by computer the missing value of $\\theta(4,K_n)$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-09-21T18:10:31.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10"
    ],
    "keywords": [
      "complete graph",
      "girth-thickness",
      "minimum number",
      "planar subgraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}