Stefan Burr | |
---|---|
Stefan Burr at his home, in February 2015.
|
|
Born | Stefan Andrus Burr 1940 (age 76–77) |
Residence | Morristown, New Jersey |
Fields | Mathematics and Computer Science |
Institutions |
The City College of New York AT&T Long Lines |
Alma mater |
University of California, Berkeley (A.B., Mathematics) Princeton University (M.A.; Ph.D. Mathematics, 1969) |
Doctoral advisor | Bernard Morris Dwork |
Known for |
Ramsey Theory Number theory |
Stefan Andrus Burr (born 1940) is a mathematician and computer scientist. He is a retired professor of Computer Science at The City College of New York.
Burr received his Ph.D. in 1969 from Princeton University under the supervision of Bernard Dwork; his thesis research involved the Waring–Goldbach problem 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. The Erdős–Burr conjecture, published as a conjecture by Erdős and Burr in 1975 and still unsolved, states that sparse graphs have linearly growing Ramsey numbers.