Peter Keevash
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 72
- Advanced Combinatorial Mathematics 18
- Finite Group Theory Research 4
-
- Advanced Graph Theory Research 9
- Complexity and Algorithms in Graphs 4
- Co-authors
- Benny Sudakov (24 shared papers)Dhruv Mubayi (6 shared papers)Richard Mycroft (6 shared papers)Tom Bohman (1 shared paper)Jacques Verstraëte (4 shared papers)József Balogh (3 shared papers)Deryk Osthus (4 shared papers)Daniela Kühn (3 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (14 papers)SIAM Journal on Discrete Mathematics (7 papers)Journal of Combinatorial Theory Series A (6 papers)Combinatorics Probability Computing (6 papers)COMBINATORICA (4 papers)
- Partner nations
- United KingdomUnited StatesIsrael
In The Last Decade
Peter Keevash
79 papers receiving 1.2k citations
Peter Keevash's Hit Papers
Peers
Comparison fields: 5 of 24
- Discrete Mathematics and Combinatorics 1.1k
- Computational Theory and Mathematics 132
- Computational Mathematics 5
- Geometry and Topology 75
- Computer Graphics and Computer-Aided Design 21
Countries citing papers authored by Peter Keevash
This map shows the geographic impact of Peter Keevash'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 Peter Keevash with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Keevash more than expected).
Fields of papers citing papers by Peter Keevash
This network shows the impact of papers produced by Peter Keevash. 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 Peter Keevash. The network helps show where Peter Keevash may publish in the future.
Co-authors
The 25 scholars most cited alongside Peter Keevash, 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 86 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Hypergraph Turán problems Hit paper breakdown → | 2011 | 138 |
| 2 | 2005 | 66 | |
| 3 | 2013 | 62 | |
| 4 | 2004 | 52 | |
| 5 | 2006 | 49 | |
| 6 | 2011 | 49 | |
| 7 | 2004 | 48 | |
| 8 | 2014 | 47 | |
| 9 | 2008 | 43 | |
| 10 | 2005 | 38 | |
| 11 | 2014 | 36 | |
| 12 | 2017 | 33 | |
| 13 | 2013 | 30 | |
| 14 | 2010 | 28 | |
| 15 | 2000 | 26 | |
| 16 | 2011 | 26 | |
| 17 | 2015 | 25 | |
| 18 | ON A HYPERGRAPH TUR ´ AN PROBLEM OF FRANKL | 2005 | 24 |
| 19 | 2009 | 23 | |
| 20 | 2020 | 23 |
About Peter Keevash
Peter Keevash is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Mathematical Physics and Applied Mathematics, having authored 86 papers that have together received 1.3k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (72 papers), Advanced Combinatorial Mathematics (18 papers), Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (4 papers), Finite Group Theory Research (4 papers), Computational Geometry and Mesh Generation (3 papers), Structural Analysis and Optimization (3 papers) and Stochastic processes and statistical mechanics (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.1k citations), Computational Theory and Mathematics (132 citations), Computational Mathematics (5 citations), Geometry and Topology (75 citations) and Computer Graphics and Computer-Aided Design (21 citations). Peter Keevash has collaborated with scholars based in United Kingdom, United States and Israel. Frequent co-authors include Benny Sudakov, Dhruv Mubayi, Richard Mycroft, Tom Bohman, Jacques Verstraëte, József Balogh, Deryk Osthus, Daniela Kühn, Dan Hefetz and Noga Alon. Their work appears in journals such as Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series A, Combinatorics Probability Computing and COMBINATORICA.
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.