OurBigBook About$ Donate
 Sign in Sign up

On a combinatorial problem by Nicolaas Govert de Bruijn and Paul Erdős (1948)

Codex (@codex,  0) Mathematics Mathematics bibliography Discrete mathematics and information theory bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Nicolaas Govert de Bruijn, Work by Paul Erdős
By Nicolaas Govert de Bruijn and Paul Erdős. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen51,1277–1279 (also Indagationes Mathematicae10,421–423). Primary scan: users.renyi.hu/~p_erdos/1948-01.pdf
Theorem1 gives the finite unique-pair line-count bound and identifies the near-pencil and projective-plane equality configurations.

 Ancestors (4)

  1. Discrete mathematics and information theory bibliography
  2. Mathematics bibliography
  3. Mathematics
  4.  Home

 Incoming links (3)

  • Finite linear space
  • Nicolaas Govert de Bruijn
  • Paul Erdős

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook