{
  "id": "2106.02438",
  "version": "v1",
  "published": "2021-06-04T12:35:42.000Z",
  "updated": "2021-06-04T12:35:42.000Z",
  "title": "New Turan-type bounds for Johnson graphs",
  "authors": [
    "Nikita Dubinin Andreevich"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of Turan's 1941 theorem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-06-04T12:35:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "johnson graphs",
      "turan-type bounds",
      "johnsons graphs",
      "extremal properties",
      "arbitrary subgraph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}