Tripti Joshi (Editor)

Stefan Burr

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Name
  
Stefan Burr

Role
  
Mathematician


Education
  
Princeton University

Doctoral advisor
  
Bernard Dwork

Stefan Burr

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)

Known for
  
Ramsey Theory Number theory

Residence
  
Morristown, New Jersey, United States

Fields
  
Mathematics, Computer Science

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.

Stefan Burr Stefan Burr Wikipedia

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.

Selected publications

  • "On uniform elementary estimates of arithmetic sums". Proc. Amer. Math. Soc. 39: 497–502. 1973. MR 0314784. doi:10.1090/s0002-9939-1973-0314784-8. 
  • with P. Erdõs and J. H. Spencer: "Ramsey theorems for multiple copies of graphs". Trans. Amer. Math. Soc. 209: 87–99. 1975. MR 0409255. doi:10.1090/s0002-9947-1975-0409255-0. 
  • 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. MR 637704. doi:10.1090/s0002-9947-1982-0637704-5. 
  • References

    Stefan Burr Wikipedia