de Bruijn-Erdős theorem
Meanings
name
- 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.
- A theorem that states a lower bound on the number of lines determined by n points in a projective plane.
Word forms
Etymology
Named after the mathematicians Nicolaas Govert de Bruijn and Paul Erdős.
Previous
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.