Jon Folkman
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Optimization and Variational Analysis
Papers in
-
- Advanced Topology and Set Theory 5
-
- Limits and Structures in Graph Theory 3
- Co-authors
- Jim Lawrence (1 shared paper)Norman Shapiro (2 shared papers)George B. Dantzig (1 shared paper)Melvin A. Breuer (1 shared paper)Ronald Graham (2 shared papers)D. R. Fulkerson (1 shared paper)Sidney C. Port (2 shared papers)Ron Graham (1 shared paper)
- Journals
- SIAM Journal on Applied Mathematics (2 papers)Proceedings of the American Mathematical Society (2 papers)Journal of Mathematical Analysis and Applications (2 papers)Journal of Combinatorial Theory Series A (2 papers)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- United States
In The Last Decade
Jon Folkman
19 papers receiving 611 citations
Peers
Comparison fields: 5 of 63
- Discrete Mathematics and Combinatorics 257
- Computational Theory and Mathematics 413
- Geometry and Topology 216
- Algebra and Number Theory 86
- Numerical Analysis 97
Countries citing papers authored by Jon Folkman
This map shows the geographic impact of Jon Folkman'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 Jon Folkman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jon Folkman more than expected).
Fields of papers citing papers by Jon Folkman
This network shows the impact of papers produced by Jon Folkman. 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 Jon Folkman. The network helps show where Jon Folkman may publish in the future.
Co-authors
The 9 scholars most cited alongside Jon Folkman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1967 | 188 | |
| 2 | 1978 | 132 | |
| 3 | 1970 | 91 | |
| 4 | 1967 | 87 | |
| 5 | THE HOMOLOGY GROUPS OF A LATTICE | 1964 | 84 |
| 6 | 1967 | 34 | |
| 7 | 1969 | 21 | |
| 8 | 1970 | 16 | |
| 9 | 1966 | 15 | |
| 10 | 1970 | 12 | |
| 11 | 1971 | 10 | |
| 12 | 1974 | 8 | |
| 13 | 1966 | 7 | |
| 14 | 1966 | 5 | |
| 15 | 1966 | 4 | |
| 16 | On Markov chains with the strong ratio limit property | 1965 | 3 |
| 17 | 1968 | 3 | |
| 18 | 1968 | 1 | |
| 19 | 2018 | 1 | |
| 20 | 1972 | 1 |
About Jon Folkman
Jon Folkman is a scholar working on Geometry and Topology, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Mathematical Physics and Algebra and Number Theory, having authored 20 papers that have together received 723 indexed citations. Recurring topics across this work include Advanced Topology and Set Theory (5 papers), Limits and Structures in Graph Theory (3 papers), Computational Geometry and Mesh Generation (2 papers), Rings, Modules, and Algebras (2 papers), Management and Optimization Techniques (1 paper), Data Management and Algorithms (1 paper), Reliability and Maintenance Optimization (1 paper) and Coding theory and cryptography (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (257 citations), Computational Theory and Mathematics (413 citations), Geometry and Topology (216 citations), Algebra and Number Theory (86 citations) and Numerical Analysis (97 citations). Jon Folkman has collaborated with scholars based in United States. Frequent co-authors include Jim Lawrence, Norman Shapiro, George B. Dantzig, Melvin A. Breuer, Ronald Graham, D. R. Fulkerson, Sidney C. Port, Ron Graham and Fan Chung. Their work appears in journals such as SIAM Journal on Applied Mathematics, Proceedings of the American Mathematical Society, Journal of Mathematical Analysis and Applications, Journal of Combinatorial Theory Series A and Journal of Combinatorial Theory Series B.
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.