"Turán's theorem" meaning in English

{
  "etymology_text": "Named after the Hungarian mathematician Pál Turán.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges."
      ],
      "id": "en-Turán's_theorem-en-name-df6~oHu5",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "clique",
          "clique"
        ],
        [
          "maximum",
          "maximum"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges."
      ],
      "related": [
        {
          "word": "Turán graph"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Pál Turán",
        "Turán's theorem"
      ]
    }
  ],
  "word": "Turán's theorem"
}

{
  "etymology_text": "Named after the Hungarian mathematician Pál Turán.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Turán's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "related": [
    {
      "word": "Turán graph"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Á",
        "English terms spelled with ◌́",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Graph theory"
      ],
      "glosses": [
        "A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "clique",
          "clique"
        ],
        [
          "maximum",
          "maximum"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Pál Turán",
        "Turán's theorem"
      ]
    }
  ],
  "word": "Turán's theorem"
}