{
  "id": "2001.02628",
  "version": "v1",
  "published": "2020-01-07T06:20:21.000Z",
  "updated": "2020-01-07T06:20:21.000Z",
  "title": "Extremal graphs for wheels",
  "authors": [
    "Long-Tu Yuan"
  ],
  "comment": "11 pages. arXiv admin note: text overlap with arXiv:1903.10319",
  "categories": [
    "math.CO"
  ],
  "abstract": "A wheel graph is a graph formed by connecting a single vertex to all vertices of a cycle. The extremal graphs for wheels on even number of vertices is determined by Simonovits in 1960s. In this paper, we determine the Tur\\'{a}n numbers of wheels on odd number vertices. Wheels on odd numbers of vertices are the first cases that the extremal graphs are characterized when the decomposition families of graphs do not contain a linear forest.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-01-07T06:20:21.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "extremal graphs",
      "odd number vertices",
      "first cases",
      "decomposition families",
      "single vertex"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}