David Conlon
Discrete Mathematics and Combinatorics · 2006–2018
A researcher in the Science corpus: 11 papers; trusts 31 researchers and is trusted by 15 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 64 citations into it; #203 of 2,017 by trust here, #210 by citations
- Geometry and Topology — 52 citations into it; #1,112 of 7,422 by trust here, #1,324 by citations
- Computational Theory and Mathematics — 49 citations into it; #1,593 of 12,182 by trust here, #2,629 by citations
- Algebra and Number Theory — 16 citations into it
- Mathematical Physics — 8 citations into it
- Statistics and Probability — 7 citations into it
Whom David Conlon trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- William T. Gowers
- Ben Joseph Green
- Alexander A. Razborov
- Terence Tao
- Boris Bukh
- Vladimir Nikiforov
- Vojtech Rödl
- Christian Reiher
- Omer Reingold
- Luca Trevisan
Who trusts David Conlon overall
- A. Sah
- Peter Keevash
- Jacob Fox
- L. Lov'asz
- Marcelo Campos
- Joonkyung Lee
- Robert Morris
- Choongbum Lee
- Simon Griffiths
- János Pach
Papers from David Conlon's perspective
Ordered by how strongly the researchers David Conlon trusts endorse each paper. Same corpus, a different order for every researcher.
- The Probabilistic Method
- The primes contain arbitrarily long arithmetic progressions
- Dense Subsets of Pseudorandom Sets
- The number of cliques in graphs of given order and size
- Flag algebras (Journal of Symbolic Logic (JSL))
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
- Hypergraph containers
- An Approximate Version of Sidorenko’s Conjecture
Their papers
- An Approximate Version of Sidorenko’s Conjecture (2010) — 132 citations
- Combinatorial theorems in sparse random sets (2010) — 243 citations
- A relative Szemerédi theorem (2013) — 62 citations
- A new upper bound for diagonal Ramsey numbers (2006) — 199 citations
- Hypergraph Ramsey numbers (2008) — 126 citations
- Finite reflection groups and graph norms (2016) — 70 citations
- On the KŁR conjecture in random graphs (2013) — 80 citations
- Sidorenko's conjecture for blow-ups (2018) — 58 citations
- Rational exponents in extremal graph theory (2015) — 65 citations
- Graphs with few paths of prescribed length between any two vertices (2014) — 47 citations
- The Erdős–Gyárfás problem on generalized Ramsey numbers (2014) — 56 citations