"Robertson-Seymour theorem" meaning in English

{
  "etymology_text": "Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.",
  "forms": [
    {
      "form": "the Robertson-Seymour theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Robertson-Seymour 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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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 the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering."
      ],
      "id": "en-Robertson-Seymour_theorem-en-name-Q99m51xW",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "undirected",
          "undirected"
        ],
        [
          "minor",
          "minor"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Robertson-Seymour theorem"
      ]
    }
  ],
  "word": "Robertson-Seymour theorem"
}

{
  "etymology_text": "Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.",
  "forms": [
    {
      "form": "the Robertson-Seymour theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Robertson-Seymour theorem",
      "name": "en-proper noun"
    }
  ],
  "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:Graph theory"
      ],
      "glosses": [
        "A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "undirected",
          "undirected"
        ],
        [
          "minor",
          "minor"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Robertson-Seymour theorem"
      ]
    }
  ],
  "word": "Robertson-Seymour theorem"
}