Peter Keevash
Peter Keevash publishes mostly in Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, on topics such as Limits and Structures in Graph Theory, Advanced Graph Theory Research and Graph theory and applications.
- World rank
- #869,878 of 7,710,434 ranked researchers
- Rank in United Kingdom
- #71,644 of 367,258
- Works
- 155
- Citations
- 2.4k
- Citations per work
- 15.3
What does Peter Keevash research?
Peter Keevash's work is mostly in Mathematics (50%), Computer Science (25%), Engineering (8%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences12882.8%
- Mathematics7850.3%
- Computer Science3824.7%
- Engineering127.8%
- Everything else2717.2%
- 1Discrete Mathematics and Combinatorics30% of their works
- 2Computational Theory and Mathematics25% of their works
- 3Geometry and Topology12% of their works
- 4Electrical and Electronic Engineering8% of their works
- 5Mathematical Physics5% of their works
- 6Applied Mathematics4% of their works
Research topics
Which keywords describe Peter Keevash's research?
The keywords of their largest research topics: Graph Limits, Szemerédi's Theorem, Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Graph Spectra and Topological Indices.
- Metric Dimension
- Spatstat
- Complexity Theory
- Topological Dynamics
- Spectral Amplitude Coding
- Topological Indices
- Parameterized Complexity
- Approximation Algorithms
- Szemerédi's Theorem
- Graph Limits
- Algorithmic Applications
- Graph Theory
- Graph Spectra
- Fiber Bragg Grating
- Model Theory
- Combinatorial Optimization
- Point Processes
- Graph Labeling
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Graph Limits1181 topic
- Szemerédi's Theorem1181 topic
- Algorithmic Applications902 topics
- Approximation Algorithms902 topics
- Graph Theory751 topic
- Parameterized Complexity751 topic
- Graph Spectra351 topic
- Topological Indices351 topic
- Fiber Bragg Grating341 topic
- Spectral Amplitude Coding341 topic
- Model Theory191 topic
- Topological Dynamics191 topic
- Combinatorial Optimization151 topic
- Complexity Theory151 topic
- Point Processes141 topic
- Spatstat141 topic
- Graph Labeling131 topic
- Metric Dimension131 topic
Where does Peter Keevash work?
Peter Keevash's main affiliation in the publication record is University of Oxford, United Kingdom.
How many publications and citations does Peter Keevash have?
OpenAlex counts 155 works and 2,373 citations for Peter Keevash, an h-index of 26, ranking #869,878 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Peter Keevash. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.