de Bruijn-Erdős theorem

Hello, you have come here looking for the meaning of the word de Bruijn-Erdős theorem. In DICTIOUS you will not only get to know all the dictionary meanings for the word de Bruijn-Erdős theorem, but we will also tell you about its etymology, its characteristics and you will know how to say de Bruijn-Erdős theorem in singular and plural. Everything you need to know about the word de Bruijn-Erdős theorem you have here. The definition of the word de Bruijn-Erdős theorem will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofde Bruijn-Erdős theorem, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

Etymology

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

Proper noun

de Bruijn-Erdős theorem

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