de Bruijn-Erdős theorem

proper noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryA 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.
  2. geometryA theorem that states a lower bound on the number of lines determined by n points in a projective plane.

Origin

Named after the mathematicians Nicolaas Govert de Bruijn and Paul Erdős.

Full word history & related roots →
Cite this entry
APA

de Bruijn-Erdős theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/de%20Bruijn-Erd%C5%91s%20theorem

MLA

“de Bruijn-Erdős theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/de%20Bruijn-Erd%C5%91s%20theorem. Accessed November 5, 2026.

Chicago

WatkinsX Dictionary, s.v. “de Bruijn-Erdős theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/de%20Bruijn-Erd%C5%91s%20theorem.

Source: de Bruijn-Erdős theorem on Wiktionary, CC BY-SA 4.0.