Jeff Kahn
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 47
-
- Graph theory and applications 28
- Co-authors
- Gil Kalai (6 shared papers)Michael Saks (6 shared papers)János Komlós (3 shared papers)Nathan Linial (4 shared papers)Endre Szemerédi (2 shared papers)Ehud Friedgut (4 shared papers)Jeong Han Kim (2 shared papers)Anders F. Johansson (1 shared paper)
- Journals
- COMBINATORICA (14 papers)Journal of Combinatorial Theory Series A (10 papers)Random Structures and Algorithms (9 papers)Combinatorics Probability Computing (8 papers)Proceedings of the American Mathematical Society (4 papers)
- Partner nations
- United StatesIsraelNetherlands
In The Last Decade
Jeff Kahn
91 papers receiving 1.9k citations
Peers
Comparison fields: 5 of 98
- Discrete Mathematics and Combinatorics 1.0k
- Computational Theory and Mathematics 1.1k
- Geometry and Topology 546
- Statistics and Probability 336
- Mathematical Physics 316
Countries citing papers authored by Jeff Kahn
This map shows the geographic impact of Jeff Kahn'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 Jeff Kahn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeff Kahn more than expected).
Fields of papers citing papers by Jeff Kahn
This network shows the impact of papers produced by Jeff Kahn. 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 Jeff Kahn. The network helps show where Jeff Kahn may publish in the future.
Co-authors
The 25 scholars most cited alongside Jeff Kahn, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 97 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1993 | 129 | |
| 2 | 2001 | 104 | |
| 3 | 1984 | 104 | |
| 4 | 1995 | 98 | |
| 5 | 1992 | 95 | |
| 6 | 1996 | 91 | |
| 7 | 2008 | 77 | |
| 8 | 2021 | 66 | |
| 9 | 1984 | 62 | |
| 10 | 1995 | 50 | |
| 11 | 1996 | 48 | |
| 12 | 1992 | 47 | |
| 13 | 2004 | 46 | |
| 14 | 2012 | 45 | |
| 15 | 1992 | 44 | |
| 16 | 1998 | 44 | |
| 17 | 1988 | 44 | |
| 18 | 1996 | 43 | |
| 19 | 2007 | 43 | |
| 20 | 1980 | 38 |
About Jeff Kahn
Jeff Kahn is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Statistics and Probability and Mathematical Physics, having authored 97 papers that have together received 2.0k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (47 papers), Advanced Graph Theory Research (36 papers), Graph theory and applications (28 papers), Markov Chains and Monte Carlo Methods (14 papers), Stochastic processes and statistical mechanics (9 papers), Graph Labeling and Dimension Problems (9 papers), graph theory and CDMA systems (8 papers) and Advanced Algebra and Logic (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Computational Theory and Mathematics (1.1k citations), Geometry and Topology (546 citations), Statistics and Probability (336 citations) and Mathematical Physics (316 citations). Jeff Kahn has collaborated with scholars based in United States, Israel and Netherlands. Frequent co-authors include Gil Kalai, Michael Saks, János Komlós, Nathan Linial, Endre Szemerédi, Ehud Friedgut, Jeong Han Kim, Anders F. Johansson, Van Thuong Vu and David Galvin. Their work appears in journals such as COMBINATORICA, Journal of Combinatorial Theory Series A, Random Structures and Algorithms, Combinatorics Probability Computing and Proceedings of the American Mathematical Society.
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.