J. Kahn
Impact in
-
- Limits and Structures in Graph Theory
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Limits and Structures in Graph Theory 11
-
- Advanced Graph Theory Research 7
- Complexity and Algorithms in Graphs 3
- Graph Labeling and Dimension Problems 2
- Co-authors
- Gil Kalai (1 shared paper)Nathan Linial (1 shared paper)Joel Friedman (1 shared paper)Endre Szemerédi (1 shared paper)Paul Seymour (1 shared paper)Noga Alon (1 shared paper)Clifford Smyth (1 shared paper)Michael Saks (1 shared paper)
- Journals
- Random Structures and Algorithms (3 papers)Combinatorics Probability Computing (3 papers)Israel Journal of Mathematics (2 papers)Journal of Combinatorial Theory Series A (2 papers)JAMA (1 paper)
- Partner nations
- United StatesIsraelHungary
In The Last Decade
J. Kahn
16 papers receiving 537 citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 138
- Computational Theory and Mathematics 312
- Statistics and Probability 99
- Geometry and Topology 101
- Mathematical Physics 79
Countries citing papers authored by J. Kahn
This map shows the geographic impact of J. 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 J. Kahn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Kahn more than expected).
Fields of papers citing papers by J. Kahn
This network shows the impact of papers produced by J. 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 J. Kahn. The network helps show where J. Kahn may publish in the future.
Co-authors
The 12 scholars most cited alongside J. 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
| # | Work | ||
|---|---|---|---|
| 1 | 1988 | 349 | |
| 2 | 1989 | 125 | |
| 3 | 1987 | 24 | |
| 4 | 1995 | 23 | |
| 5 | 2002 | 19 | |
| 6 | 2001 | 15 | |
| 7 | 2009 | 9 | |
| 8 | 2014 | 6 | |
| 9 | 2011 | 4 | |
| 10 | 2009 | 3 | |
| 11 | 2014 | 3 | |
| 12 | 1988 | 3 | |
| 13 | 2018 | 2 | |
| 14 | 2012 | 2 | |
| 15 | 1986 | 1 | |
| 16 | 1978 | 1 | |
| 17 | 2019 | 0 |
About J. Kahn
J. Kahn is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics and Artificial Intelligence, having authored 17 papers that have together received 589 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (11 papers), Advanced Graph Theory Research (7 papers), Complexity and Algorithms in Graphs (3 papers), Graph theory and applications (3 papers), Mathematical Dynamics and Fractals (3 papers), Markov Chains and Monte Carlo Methods (2 papers), Coding theory and cryptography (2 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (138 citations), Computational Theory and Mathematics (312 citations), Statistics and Probability (99 citations), Geometry and Topology (101 citations) and Mathematical Physics (79 citations). J. Kahn has collaborated with scholars based in United States, Israel and Hungary. Frequent co-authors include Gil Kalai, Nathan Linial, Joel Friedman, Endre Szemerédi, Paul Seymour, Noga Alon, Clifford Smyth, Michael Saks, H. S. Witsenhausen and Andrzej Ehrenfeucht. Their work appears in journals such as Random Structures and Algorithms, Combinatorics Probability Computing, Israel Journal of Mathematics, Journal of Combinatorial Theory Series A and JAMA.
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.