Stefan Burr
American mathematician / From Wikipedia, the free encyclopedia
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.
Quick Facts Born, Alma mater ...
Stefan Burr | |
---|---|
Born | Stefan Andrus Burr 1940 (age 83–84)[1] |
Alma mater | University of California, Berkeley (A.B., Mathematics) Princeton University (M.A.; Ph.D. Mathematics, 1969) |
Known for | Ramsey Theory Number theory |
Scientific career | |
Fields | Mathematics and Computer Science |
Institutions | The City College of New York AT&T Long Lines |
Doctoral advisor | Bernard Morris Dwork[2] |
Close
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.[2]
Many of his subsequent publications involve problems from the field of Ramsey theory. He has published 27 papers with Paul Erdős.[3] The Burr–Erdős conjecture, published as a conjecture by Burr and Erdős in 1975, solved only in 2015, states that sparse graphs have linearly growing Ramsey numbers.