de Bruijn-Erdős theorem

Meaning

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.
• A 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.