Word.ws English Dictionary

de Bruijn-Erdős theorem

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.

Proper noun

de Bruijn-Erdős theorem

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

Origin of de Bruijn-Erdős theorem

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

Questions about de Bruijn-Erdős theorem

What does de Bruijn-Erdős theorem mean?
De Bruijn-Erdős theorem means 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.
What part of speech is de Bruijn-Erdős theorem?
De Bruijn-Erdős theorem is a proper noun.

Words near de Bruijn-Erdős theorem in the dictionary

  1. de Bruijn sequences
  2. de Bruijn tori
  3. de Bruijn torus
  4. de Bruijn toruses
  5. de Bruijn's theorem
  6. de Bruijn-Erdős theorem
  7. de Bruijn-Newman constant
  8. De Bruyn
  9. de Bryan
  10. de Burgh
  11. de Burgo

Source and license

Adapted from Wiktionary: de Bruijn-Erdős theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “de Bruijn-Erdős theorem.” Word.ws, https://word.ws/de_bruijn-erd%C5%91s_theorem. Based on Wiktionary, CC BY-SA 4.0.