|Stefan Andrus Burr|
Stefan Burr at his home, in February 2015.
|Born||1940 (age 75–76)|
|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
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.
- "On uniform elementary estimates of arithmetic sums". Proc. Amer. Math. Soc. 39: 497–502. 1973. doi:10.1090/s0002-9939-1973-0314784-8. MR 0314784.
- with P. Erdõs and J. H. Spencer: "Ramsey theorems for multiple copies of graphs". Trans. Amer. Math. Soc. 209: 87–99. 1975. doi:10.1090/s0002-9947-1975-0409255-0. MR 0409255.
- with P. Erdõs, R. J. Faudree, C. C. Rousseau and R. H. Schelp: "Ramsey numbers for the pair sparse graph-path or cycle". Trans. Amer. Math. Soc. 269: 501–512. 1982. doi:10.1090/s0002-9947-1982-0637704-5. MR 637704.
|P ≟ NP||This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.|
|This article about an American mathematician is a stub. You can help Wikipedia by expanding it.|