Peter Keevash
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 1%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Limits and Structures in Graph Theory 59
- Finite Group Theory Research 7
-
- Advanced Graph Theory Research 42
- Graph Labeling and Dimension Problems 6
- Co-authors
- Benny Sudakov (24 shared papers)Dhruv Mubayi (5 shared papers)Richard Mycroft (4 shared papers)Jacques Verstraëte (4 shared papers)József Balogh (3 shared papers)Daniela Kühn (3 shared papers)Dan Hefetz (2 shared papers)Deryk Osthus (4 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (12 papers)Combinatorics Probability Computing (6 papers)SIAM Journal on Discrete Mathematics (5 papers)Journal of Combinatorial Theory Series A (5 papers)COMBINATORICA (4 papers)
- Partner nations
- United KingdomUnited StatesIsrael
In The Last Decade
Peter Keevash
70 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 41
- Discrete Mathematics and Combinatorics 921
- Geometry and Topology 547
- Computational Theory and Mathematics 759
- Computational Mathematics 10
- Algebra and Number Theory 47
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 76 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 122 | |
| 2 | 2011 | 104 | |
| 3 | 2005 | 61 | |
| 4 | 2004 | 49 | |
| 5 | 2004 | 46 | |
| 6 | 2006 | 45 | |
| 7 | 2008 | 39 | |
| 8 | 2011 | 39 | |
| 9 | 2005 | 36 | |
| 10 | 2013 | 27 | |
| 11 | 2000 | 26 | |
| 12 | 2010 | 24 | |
| 13 | ON A HYPERGRAPH TUR ´ AN PROBLEM OF FRANKL | 2005 | 23 |
| 14 | 2011 | 21 | |
| 15 | 2018 | 20 | |
| 16 | 2009 | 20 | |
| 17 | 2020 | 20 | |
| 18 | 2004 | 19 | |
| 19 | 2016 | 18 | |
| 20 | 2006 | 18 |
About Peter Keevash
Peter Keevash is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Applied Mathematics, having authored 76 papers that have together received 1.1k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (59 papers), Advanced Graph Theory Research (42 papers), Graph theory and applications (22 papers), graph theory and CDMA systems (19 papers), Advanced Topology and Set Theory (10 papers), Point processes and geometric inequalities (7 papers), Finite Group Theory Research (7 papers) and Graph Labeling and Dimension Problems (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (921 citations), Geometry and Topology (547 citations), Computational Theory and Mathematics (759 citations), Computational Mathematics (10 citations) and Algebra and Number Theory (47 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, Jacques Verstraëte, József Balogh, Daniela Kühn, Dan Hefetz, Deryk Osthus, Noga Alon and Will Perkins. Their work appears in journals such as Journal of Combinatorial Theory Series B, Combinatorics Probability Computing, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series A 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.