Stefan Andrus Burr (born 1940) is a
mathematician and
computer scientist
A computer scientist is a person who is trained in the academic study of computer science.
Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (al ...
. He is a retired professor of Computer Science at
The City College of New York
The City College of the City University of New York (also known as the City College of New York, or simply City College or CCNY) is a public university within the City University of New York (CUNY) system in New York City. Founded in 1847, City ...
.
Burr received his Ph.D. in 1969 from
Princeton University under the supervision of
Bernard Dwork; his thesis research involved the
Waring–Goldbach problem The Waring–Goldbach problem is a problem in additive number theory, concerning the representation of integers as sums of powers of prime numbers. It is named as a combination of Waring's problem on sums of powers of integers, and the Goldbach con ...
in
number theory, which concerns the representations of integers as sums of powers of
prime numbers.
[.]
Many of his subsequent publications involve problems from the field of
Ramsey theory. He has published 27 papers with
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in ...
.
The
Burr–Erdős conjecture In mathematics, the Burr–Erdős conjecture was a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Stefan Burr and Paul Erdős, and is one of many conjectures named after Erdős; it states that the Ramsey nu ...
, published as a conjecture by Burr and Erdős in 1975, solved only in 2015, states that
sparse graphs have
linearly growing Ramsey number
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To demonstrate the theorem for two colours (say ...
s.
Selected publications
*
*with
P. Erdõs and
J. H. Spencer:
*with
P. Erdõs,
R. J. Faudree,
C. C. Rousseau
Cecil Clyde Rousseau, Jr. (January 13, 1938 Philadelphia - April 10, 2020 Memphis) was a mathematician and author who specialized in graph theory and combinatorics. He was a professor at The University of Memphis starting in 1970 until retiring in ...
and
R. H. Schelp:
References
Living people
20th-century American mathematicians
21st-century American mathematicians
Combinatorialists
Princeton University faculty
City College of New York faculty
1940 births
Princeton University alumni
{{US-mathematician-stub