de Bruijn-Erdős theorem

短语

释义与例句

name
  1. 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. 2.

    A theorem that states a lower bound on the number of lines determined by n points in a projective plane.

    数学

词源

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

来源：wiktionary