"van der Waerden's theorem" meaning in English

{
  "etymology_text": "Named after the Dutch mathematician B. L. van der Waerden.",
  "head_templates": [
    {
      "args": {
        "head": "van der Waerden's theorem"
      },
      "expansion": "van der Waerden's theorem",
      "name": "en-prop"
    }
  ],
  "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "In Ramsey theory, a theorem stating that, for any given positive integers r and k, there is some number N such that if the integers {1, 2, ..., N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression whose elements are of the same color."
      ],
      "id": "en-van_der_Waerden's_theorem-en-name-gpR6kh~1",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "Ramsey theory",
          "Ramsey theory"
        ],
        [
          "positive",
          "positive"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "arithmetic progression",
          "arithmetic progression"
        ],
        [
          "element",
          "element"
        ]
      ],
      "raw_glosses": [
        "(mathematics) In Ramsey theory, a theorem stating that, for any given positive integers r and k, there is some number N such that if the integers {1, 2, ..., N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression whose elements are of the same color."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "van der Waerden's theorem"
}

{
  "etymology_text": "Named after the Dutch mathematician B. L. van der Waerden.",
  "head_templates": [
    {
      "args": {
        "head": "van der Waerden's theorem"
      },
      "expansion": "van der Waerden's theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "glosses": [
        "In Ramsey theory, a theorem stating that, for any given positive integers r and k, there is some number N such that if the integers {1, 2, ..., N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression whose elements are of the same color."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "Ramsey theory",
          "Ramsey theory"
        ],
        [
          "positive",
          "positive"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "arithmetic progression",
          "arithmetic progression"
        ],
        [
          "element",
          "element"
        ]
      ],
      "raw_glosses": [
        "(mathematics) In Ramsey theory, a theorem stating that, for any given positive integers r and k, there is some number N such that if the integers {1, 2, ..., N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression whose elements are of the same color."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "van der Waerden's theorem"
}