Peter Keevash

2.3k total citations
70 papers, 869 citations indexed

About

Peter Keevash is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Peter Keevash has authored 70 papers receiving a total of 869 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Discrete Mathematics and Combinatorics, 43 papers in Computational Theory and Mathematics and 28 papers in Geometry and Topology. Recurrent topics in Peter Keevash's work include Limits and Structures in Graph Theory (54 papers), Advanced Graph Theory Research (39 papers) and Graph theory and applications (20 papers). Peter Keevash is often cited by papers focused on Limits and Structures in Graph Theory (54 papers), Advanced Graph Theory Research (39 papers) and Graph theory and applications (20 papers). Peter Keevash collaborates with scholars based in United Kingdom, United States and Israel. Peter Keevash's co-authors include Benny Sudakov, Dhruv Mubayi, Richard Mycroft, Jacques Verstraëte, József Balogh, Dan Hefetz, Deryk Osthus, Daniela Kühn, Noga Alon and Mark Walters and has published in prestigious journals such as Transactions of the American Mathematical Society, Inventiones mathematicae and SIAM Journal on Computing.

In The Last Decade

Peter Keevash

65 papers receiving 802 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Peter Keevash United Kingdom	17	728	583	423	219	60	70	869
Jacques Verstraëte United States	16	597 0.8×	574 1.0×	322 0.8×	174 0.8×	37 0.6×	69	716
Vsevolod F. Lev Israel	14	391 0.5×	249 0.4×	196 0.5×	124 0.6×	45 0.8×	69	571
Yahya Ould Hamidoune France	17	534 0.7×	583 1.0×	396 0.9×	357 1.6×	64 1.1×	86	943
Felix Lazebnik United States	16	545 0.7×	407 0.7×	332 0.8×	273 1.2×	283 4.7×	55	835
Jan van den Heuvel United Kingdom	18	398 0.5×	893 1.5×	204 0.5×	288 1.3×	27 0.5×	52	1.1k
József Solymosi Canada	13	380 0.5×	286 0.5×	195 0.5×	61 0.3×	56 0.9×	75	653
Jürgen Bokowski Germany	14	191 0.3×	166 0.3×	180 0.4×	109 0.5×	27 0.5×	62	491
Seiya Negami Japan	15	208 0.3×	480 0.8×	235 0.6×	116 0.5×	34 0.6×	75	669
Thomas Brylawski United States	10	220 0.3×	307 0.5×	158 0.4×	109 0.5×	44 0.7×	16	506
Oriol Serra Spain	13	338 0.5×	359 0.6×	196 0.5×	220 1.0×	98 1.6×	91	617

Countries citing papers authored by Peter Keevash

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Peter Keevash

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Keevash. A scholar is included among the top collaborators of Peter Keevash based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Peter Keevash. Peter Keevash is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Keevash, Peter, et al.. (2025). Ringel’s tree packing conjecture in quasirandom graphs. Journal of the European Mathematical Society. 27(5). 1769–1826.

Keevash, Peter, et al.. (2024). On the largest product-free subsets of the alternating groups. Inventiones mathematicae. 237(3). 1329–1375.

Keevash, Peter, et al.. (2024). The sharp doubling threshold for approximate convexity. Bulletin of the London Mathematical Society. 56(10). 3229–3239.

Keevash, Peter, et al.. (2023). Locality in sumsets. 568–578. 2 indexed citations

Keevash, Peter, et al.. (2023). Isoperimetric stability in lattices. Proceedings of the American Mathematical Society. 1 indexed citations

Keevash, Peter, et al.. (2022). New bounds for Ryser’s conjecture and related problems. Repository for Publications and Research Data (ETH Zurich). 9(8). 288–321. 13 indexed citations

Keevash, Peter, et al.. (2019). Algorithms for #BIS-hard problems on expander graphs. arXiv (Cornell University). 2235–2247. 4 indexed citations

Keevash, Peter, et al.. (2014). Polynomial-time perfect matchings in dense hypergraphs. Advances in Mathematics. 269. 265–334. 10 indexed citations

Keevash, Peter, et al.. (2013). Polynomial-time perfect matchings in dense hypergraphs. University of Birmingham Research Portal (University of Birmingham). 311–320. 4 indexed citations

10.

Ellis, David, et al.. (2013). An Approximate Vertex-Isoperimetric Inequality for $r$-sets. The Electronic Journal of Combinatorics. 20(4). 2 indexed citations

11.

Keevash, Peter, Daniela Kühn, Richard Mycroft, & Deryk Osthus. (2011). Loose Hamilton cycles in hypergraphs. Discrete Mathematics. 311(7). 544–559. 35 indexed citations

12.

Keevash, Peter & Benny Sudakov. (2009). Triangle packings and 1-factors in oriented graphs. Journal of Combinatorial Theory Series B. 99(4). 709–727. 16 indexed citations

13.

Balogh, József, Peter Keevash, & Benny Sudakov. (2006). On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. Journal of Combinatorial Theory Series B. 96(6). 919–932. 4 indexed citations

14.

Keevash, Peter & Benny Sudakov. (2006). Sparse halves in triangle-free graphs. Journal of Combinatorial Theory Series B. 96(4). 614–620. 9 indexed citations

15.

Keevash, Peter, Dhruv Mubayi, & Richard M. Wilson. (2006). Set Systems with No Singleton Intersection. SIAM Journal on Discrete Mathematics. 20(4). 1031–1041. 16 indexed citations

16.

Keevash, Peter. (2005). The Turán problem for projective geometries. Journal of Combinatorial Theory Series A. 111(2). 289–309. 5 indexed citations

17.

Balogh, József, Peter Keevash, & Benny Sudakov. (2005). Disjoint representability of sets and their complements. Journal of Combinatorial Theory Series B. 95(1). 12–28. 11 indexed citations

18.

Keevash, Peter & Benny Sudakov. (2005). On a restricted cross-intersection problem. Journal of Combinatorial Theory Series A. 113(7). 1536–1542. 3 indexed citations

19.

Keevash, Peter, et al.. (2004). Multicolour Turán problems. Advances in Applied Mathematics. 33(2). 238–262. 18 indexed citations

20.

Hambly, Ben, Peter Keevash, Neil O’Connell, & Dudley Stark. (2000). The characteristic polynomial of a random permutation matrix. Stochastic Processes and their Applications. 90(2). 335–346. 24 indexed citations

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.

Explore authors with similar magnitude of impact