Definitions from Wiktionary (de Bruijn-Erdős theorem)

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


▸ Words similar to de Bruijn-Erdős theorem
▸ Usage examples for de Bruijn-Erdős theorem

▸ Idioms related to de Bruijn-Erdős theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near de Bruijn-Erdős theorem
▸ Rhymes of de Bruijn-Erdős theorem

▸ Invented words related to de Bruijn-Erdős theorem