Stefan Burr

1.5k total citations
50 papers, 730 citations indexed

About

Stefan Burr is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Stefan Burr has authored 50 papers receiving a total of 730 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 33 papers in Discrete Mathematics and Combinatorics and 31 papers in Geometry and Topology. Recurrent topics in Stefan Burr's work include Limits and Structures in Graph Theory (33 papers), Advanced Graph Theory Research (31 papers) and Advanced Topology and Set Theory (26 papers). Stefan Burr is often cited by papers focused on Limits and Structures in Graph Theory (33 papers), Advanced Graph Theory Research (31 papers) and Advanced Topology and Set Theory (26 papers). Stefan Burr collaborates with scholars based in United States, Hungary and Puerto Rico. Stefan Burr's co-authors include Paul Erdős, Péter L. Erdős, Vera Rosta, Ralph J. Faudree, Cecil Rousseau, J. Spencer, R. H. Schelp, Alan F. Karr, James E. Falk and Gary S. Bloom and has published in prestigious journals such as Annals of the New York Academy of Sciences, Mathematics of Computation and Operations Research.

In The Last Decade

Stefan Burr

48 papers receiving 666 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Stefan Burr United States	14	471	455	352	79	43	50	730
Anthony Bonato Canada	14	395 0.8×	120 0.3×	156 0.4×	202 2.6×	42 1.0×	86	760
Mike Develin United States	10	375 0.8×	116 0.3×	155 0.4×	22 0.3×	37 0.9×	29	526
Haixing Zhao China	12	162 0.3×	52 0.1×	136 0.4×	156 2.0×	38 0.9×	91	448
Geordie Williamson Australia	12	59 0.1×	242 0.5×	407 1.2×	47 0.6×	18 0.4×	33	658
Nathaniel Dean United States	10	158 0.3×	55 0.1×	35 0.1×	16 0.2×	43 1.0×	27	381
Wayne Goddard United States	20	1.1k 2.4×	342 0.8×	274 0.8×	26 0.3×	163 3.8×	125	1.4k
Jeffry L. Hirst United States	8	215 0.5×	22 0.0×	103 0.3×	21 0.3×	36 0.8×	34	381
R. Balakrishnan India	9	151 0.3×	60 0.1×	55 0.2×	12 0.2×	79 1.8×	29	330
Michael Tarsi Israel	20	873 1.9×	436 1.0×	151 0.4×	6 0.1×	404 9.4×	37	1.2k
Philip Leonard United States	10	93 0.2×	54 0.1×	77 0.2×	7 0.1×	97 2.3×	47	364

Countries citing papers authored by Stefan Burr

Since Specialization

Citations

This map shows the geographic impact of Stefan Burr's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefan Burr with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Burr more than expected).

Fields of papers citing papers by Stefan Burr

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stefan Burr. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefan Burr. The network helps show where Stefan Burr may publish in the future.

Co-authorship network of co-authors of Stefan Burr

This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Burr. A scholar is included among the top collaborators of Stefan Burr based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefan Burr. Stefan Burr is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Burr, Stefan. (1992). The Unreasonable Effectiveness of Number Theory. 6 indexed citations

Burr, Stefan. (1987). On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. Discrete Mathematics. 65(3). 215–229. 12 indexed citations

Burr, Stefan. (1987). What can we hope to accomplish in generalized Ramsey theory?. Discrete Mathematics. 67(3). 215–225. 10 indexed citations

Burr, Stefan, Péter L. Erdős, Ralph J. Faudree, & Cecil Rousseau. (1985). The Ramsey number for the pair complete bipartite graph-graph of limited degree. John Wiley & Sons, Inc. eBooks. 163–174. 7 indexed citations

Burr, Stefan, Jaroslav Nešetřil, & Vojtěch Rödl. (1985). On the use of senders in generalized ramsey theory for graphs. Discrete Mathematics. 54(1). 1–13. 15 indexed citations

Burr, Stefan, et al.. (1985). On Graphs with Ramsey-Infinite Blocks. European Journal of Combinatorics. 6(2). 129–132. 4 indexed citations

Burr, Stefan & Jerrold W. Grossman. (1982). Ramsey numbers of graphs with long tails. Discrete Mathematics. 41(3). 223–227. 6 indexed citations

Burr, Stefan. (1982). Computing cube roots when a fast square root is available. Computers & Mathematics with Applications. 8(3). 181–183. 2 indexed citations

Burr, Stefan, Péter L. Erdős, Ralph J. Faudree, Cecil Rousseau, & R. H. Schelp. (1982). Ramsey-minimal graphs for forests. Discrete Mathematics. 38(1). 23–32. 17 indexed citations

10.

Burr, Stefan, Paul Erdős, Ralph J. Faudree, Cecil Rousseau, & R. H. Schelp. (1981). Ramsey-minimal graphs for star-forests. Discrete Mathematics. 33(3). 227–237. 19 indexed citations

11.

Burr, Stefan, P. Erdös, Ralph J. Faudree, Cecil Rousseau, & R. H. Schelp. (1978). Ramsey-minimal graphs for multiple copies. Indagationes Mathematicae (Proceedings). 81(1). 187–195. 8 indexed citations

12.

Burr, Stefan, P. Erdös, Ralph J. Faudree, Cecil Rousseau, & R. H. Schelp. (1978). Ramsey-minimal graphs for multiple copies. Indagationes Mathematicae (Proceedings). 81(2). 187–195. 6 indexed citations

13.

Burr, Stefan. (1975). On detecting a periodic event by means of periodic observations. I. Mathematics of Computation. 29(129). 57–65. 1 indexed citations

14.

Burr, Stefan. (1975). On Detecting a Periodic Event by Means of Periodic Observations. I. Mathematics of Computation. 29(129). 57–57. 1 indexed citations

15.

Burr, Stefan, Péter L. Erdős, & J. Spencer. (1975). Ramsey theorems for multiple copies of graphs. Transactions of the American Mathematical Society. 209(0). 87–99. 51 indexed citations

16.

Burr, Stefan, et al.. (1975). Ramsey Theorems for Multiple Copies of Graphs. Transactions of the American Mathematical Society. 209. 87–87. 9 indexed citations

17.

Burr, Stefan & John A G Roberts. (1974). On Ramsey numbers for linear forests. Discrete Mathematics. 8(3). 245–250. 7 indexed citations

18.

Burr, Stefan. (1973). On uniform elementary estimates of arithmetic sums. Proceedings of the American Mathematical Society. 39(3). 497–502. 1 indexed citations

19.

Burr, Stefan. (1971). On Moduli for which the Fibonacci Sequence Contains a Complete System of Residues. The Fibonacci quarterly. 9(5). 497–503. 10 indexed citations

20.

Burr, Stefan, et al.. (1970). A theorem on difference equations and its generalization to operator equations. Journal of Mathematical Analysis and Applications. 30(3). 718–729. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact