Simon Griffiths

Computational Theory and Mathematics · with Morris · 2011–2023

A researcher in the Science corpus: 3 papers; trusts 10 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 13 citations into it
• Discrete Mathematics and Combinatorics — 13 citations into it
• Geometry and Topology — 9 citations into it
• Mathematical Physics — 8 citations into it

Whom Simon Griffiths trusts overall

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

1. Tom Bohman
2. David Conlon
3. A. Sah
4. Michael Krivelevich
5. Jirí Matousek

Papers from Simon Griffiths's perspective

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

1. The triangle-free process
2. The early evolution of the H-free process
3. A combinatorial problem in geometry
4. Regularity Lemmas for Graphs
5. Pseudo-random Graphs
6. Emergence of Scaling in Random Networks
7. Szemerédi’s Lemma for the Analyst
8. On the evolution of random graphs
9. Combinatorial theorems in sparse random sets
10. Using The Borsuk-Ulam Theorem

Their papers

• The chromatic thresholds of graphs (2011) — 48 citations
• An exponential improvement for diagonal Ramsey (2023) — 99 citations
• The triangle-free process and R(3,k) (2013) — 80 citations