R. Leonard Brooks

from Wikipedia, the free encyclopedia

Rowland Leonard Brooks (born February 6, 1916 in Lincolnshire , † June 18, 1993 ) was a British mathematician and full-time tax inspector.

Brooks graduated from Cambridge University . From this time he is known for Brooks' theorem in the theory of graph coloring, which he published in 1941. The theorem says that the chromatic number of a graph is equal to the maximum degree (number of edges at a node) d, except for complete graphs and cycles of odd length, which require one more color (d + 1).

With his fellow students from Trinity College , William Thomas Tutte , Cedric Smith and Arthur Harold Stone (1916-2000) he published under the pseudonym Blanche Descartes . All four also solved the problem of squaring the square (dividing a square into smaller squares) in 1940 .

He kept a lifelong interest in the problem of the division of squares. For example, he found the first dominoes squared.

Web links

Individual evidence

  1. Brooks On coloring the nodes of a network , Proc. Cambridge Philosophical Society, Volume 37, 1941, pp. 194-197
  2. A procedure for dissecting a rectangle into squares, and an example for the rectangle whose sides are in the ratio 2: 1, J. Combinatorial Theory, 10, (1971) 206-211