Peter Keevash

Discrete Mathematics and Combinatorics · 2004–2018

A researcher in the Science corpus: 9 papers; trusts 32 researchers and is trusted by 17 researchers here, as inferred from the citation graph.

Subfields

Whom Peter Keevash trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. William T. Gowers
  2. Vojtech Rödl
  3. Po-Shen Loh
  4. D. Kühn
  5. David Freedman
  6. Tom Bohman
  7. L. Lov'asz
  8. Andrzej Rucinski
  9. David Conlon
  10. Deryk Osthus

Who trusts Peter Keevash overall

  1. Matthew Kwan
  2. Stefan Glock
  3. D. Kühn
  4. Allan Siu Lun Lo
  5. Jie Han
  6. Deryk Osthus
  7. Yi Zhao
  8. A. Hinge
  9. Sam Mattheus
  10. K. Markstrom

Papers from Peter Keevash's perspective

Ordered by how strongly the researchers Peter Keevash trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The Probabilistic Method
  2. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
  3. Limits of dense graph sequences (J. Comb. Theory B)
  4. Hypergraph regularity and the multidimensional Szemerédi theorem
  5. Combinatorial theorems in sparse random sets
  6. Reducibility Among Combinatorial Problems
  7. Flag algebras (Journal of Symbolic Logic (JSL))
  8. The triangle-free process
  9. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
  10. Efficient Testing of Large Graphs (40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039))

Their papers