Stefan Burr: Difference between revisions
Appearance
Content deleted Content added
No edit summary |
|||
Line 20: | Line 20: | ||
Many of his subsequent publications involve problems from the field of [[Ramsey theory]]. He has published 27 papers with [[Paul Erdős]].<ref>{{cite web|url=http://www.renyi.hu/~p_erdos/Erdos.html|title=Paul Erdõs' papers|publisher=[[Alfréd Rényi Institute of Mathematics]] - http://www.renyi.hu|accessdate=8 March 2010}}</ref> The [[Erdős–Burr conjecture]], published as a conjecture by Erdős and Burr in 1975 and still unsolved, states that [[sparse graph]]s have [[linear growth|linearly growing]] [[Ramsey number]]s. |
Many of his subsequent publications involve problems from the field of [[Ramsey theory]]. He has published 27 papers with [[Paul Erdős]].<ref>{{cite web|url=http://www.renyi.hu/~p_erdos/Erdos.html|title=Paul Erdõs' papers|publisher=[[Alfréd Rényi Institute of Mathematics]] - http://www.renyi.hu|accessdate=8 March 2010}}</ref> The [[Erdős–Burr conjecture]], published as a conjecture by Erdős and Burr in 1975 and still unsolved, states that [[sparse graph]]s have [[linear growth|linearly growing]] [[Ramsey number]]s. |
||
==Selected publications== |
|||
*{{cite journal|title=On uniform elementary estimates of arithmetic sums|journal=Proc. Amer. Math. Soc.|year=1973|volume=39|pages=497–502|mr=0314784}} |
|||
*with [[Paul Erdõs|P. Erdõs]] and [[Joel H. Spencer|J. H. Spencer]]: {{cite journal|title=Ramsey theorems for multiple copies of graphs|journal=Trans. Amer. Math. Soc.|year=1975|volume=209|pages=87–99|mr=0409255}} |
|||
*with [[Paul Erdõs|P. Erdõs]], [[Ralph Faudree|R. J. Faudree]], [[Cecil C. Rousseau|C. C. Rousseau]] and [[Richard Schelp|R. H. Schelp]]: {{cite journal|title=Ramsey numbers for the pair sparse graph-path or cycle|journal=Trans. Amer. Math. Soc.|year=1982|volume=269|pages=501–512|mr=637704}} |
|||
== References == |
== References == |
Revision as of 21:55, 6 March 2015
Stefan Andrus Burr | |
---|---|
Born | 1940 (age 83–84)[2] |
Alma mater | University of California, Berkeley (A.B., Mathematics) Princeton University (M.A.; Ph.D. Mathematics, 1969) |
Known for | Ramsey Theory Number theory |
Spouse | Betsy |
Children | Jessica |
Scientific career | |
Fields | Mathematics and Computer Science |
Institutions | The City College of New York AT&T Long Lines |
Doctoral advisor | Bernard Morris Dwork[1] |
Notes | |
He has an Erdős number of one. |
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.[1]
Many of his subsequent publications involve problems from the field of Ramsey theory. He has published 27 papers with Paul Erdős.[3] 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.
- 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.
- 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 0637704.
References
- ^ a b Stefan Andrus Burr at the Mathematics Genealogy Project.
- ^ "Burr, Stefan A. (Stefan Andrus) 1940-", WorldCat listing, OCLC WorldCat Identities
- ^ "Paul Erdõs' papers". Alfréd Rényi Institute of Mathematics - http://www.renyi.hu. Retrieved 8 March 2010.
{{cite web}}
: External link in
(help)|publisher=