"de Bruijn-Erdős theorem" meaning in English

{
  "etymology_text": "Named after the mathematicians Nicolaas Govert de Bruijn and Paul Erdős.",
  "head_templates": [
    {
      "args": {
        "head": "de Bruijn-Erdős theorem"
      },
      "expansion": "de Bruijn-Erdős theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "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, when all finite subgraphs of an infinite graph can be colored using c colors, the same is true for the parent graph."
      ],
      "id": "en-de_Bruijn-Erdős_theorem-en-name-oWr~DKHT",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "subgraph",
          "subgraph"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that, when all finite subgraphs of an infinite graph can be colored using c colors, the same is true for the parent graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Geometry",
          "orig": "en:Geometry",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "40 60",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "36 64",
          "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+disamb"
        },
        {
          "_dis": "32 68",
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "A theorem that states a lower bound on the number of lines determined by n points in a projective plane."
      ],
      "id": "en-de_Bruijn-Erdős_theorem-en-name-1hrR97O6",
      "links": [
        [
          "geometry",
          "geometry"
        ]
      ],
      "raw_glosses": [
        "(geometry) A theorem that states a lower bound on the number of lines determined by n points in a projective plane."
      ],
      "topics": [
        "geometry",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "de Bruijn-Erdős theorem"
  ],
  "word": "de Bruijn-Erdős theorem"
}

{
  "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"
  ],
  "etymology_text": "Named after the mathematicians Nicolaas Govert de Bruijn and Paul Erdős.",
  "head_templates": [
    {
      "args": {
        "head": "de Bruijn-Erdős theorem"
      },
      "expansion": "de Bruijn-Erdős theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "en:Graph theory"
      ],
      "glosses": [
        "A theorem stating that, when all finite subgraphs of an infinite graph can be colored using c colors, the same is true for the parent graph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "subgraph",
          "subgraph"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A theorem stating that, when all finite subgraphs of an infinite graph can be colored using c colors, the same is true for the parent graph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Geometry"
      ],
      "glosses": [
        "A theorem that states a lower bound on the number of lines determined by n points in a projective plane."
      ],
      "links": [
        [
          "geometry",
          "geometry"
        ]
      ],
      "raw_glosses": [
        "(geometry) A theorem that states a lower bound on the number of lines determined by n points in a projective plane."
      ],
      "topics": [
        "geometry",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "de Bruijn-Erdős theorem"
  ],
  "word": "de Bruijn-Erdős theorem"
}