David Conlon | Academic Influence

David Conlon's AcademicInfluence.com Rankings

David Conlon

Mathematics

#1188

World Rank

#1990

Historical Rank

Measure Theory

#3717

World Rank

#4383

Historical Rank

mathematics Degrees

Download Badge

Mathematics

David Conlon's Degrees

PhD Mathematics University of Oxford
Bachelors Mathematics National University of Ireland

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is David Conlon Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Conlon is an Irish mathematician who is a Professor of Mathematics at the California Institute of Technology. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics. He proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers. He won the European Prize in Combinatorics in 2011 for his work in Ramsey theory and for his progress on Sidorenko's conjecture, and the Whitehead Prize in 2019.

(See a Problem?)

David Conlon's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorial theorems in sparse random sets (2010) (207)
A new upper bound for diagonal Ramsey numbers (2006) (174)
Recent developments in graph Ramsey theory (2015) (152)
An Approximate Version of Sidorenko’s Conjecture (2010) (109)
Hypergraph Ramsey numbers (2008) (101)
Bounds for graph regularity and removal lemmas (2011) (100)
Graph removal lemmas (2012) (99)
On the KŁR conjecture in random graphs (2013) (76)
A relative Szemerédi theorem (2013) (61)
Weak quasi‐randomness for uniform hypergraphs (2012) (61)
Some advances on Sidorenko's conjecture (2015) (59)
Extremal results in sparse pseudorandom graphs (2012) (55)
Finite reflection groups and graph norms (2016) (49)
On two problems in graph Ramsey theory (2010) (47)
Rational exponents in extremal graph theory (2015) (47)
Ramsey numbers of sparse hypergraphs (2007) (43)
An Extremal Theorem in the Hypercube (2010) (42)
Sidorenko's conjecture for blow-ups (2018) (41)
On-line Ramsey Numbers (2009) (41)
Ordered Ramsey numbers (2014) (40)
A new upper bound for the bipartite Ramsey problem (2008) (39)
An improved bound for the stepping-up lemma (2009) (37)
Combinatorial theorems relative to a random set (2014) (37)
Graphs with few paths of prescribed length between any two vertices (2014) (36)
Ramsey-type results for semi-algebraic relations (2013) (35)
The Erdős–Gyárfás problem on generalized Ramsey numbers (2014) (35)
On the Ramsey multiplicity of complete graphs (2007) (33)
More on the Extremal Number of Subdivisions (2019) (31)
Hypergraph Packing and Sparse Bipartite Ramsey Numbers (2009) (31)
On the Extremal Number of Subdivisions (2018) (28)
The Green-Tao theorem: an exposition (2014) (23)
Short Proofs of Some Extremal Results (2012) (23)
Short proofs of some extremal results II (2015) (21)
Quasirandomness in hypergraphs (2017) (21)
The Ramsey number of books (2018) (20)
Lower bounds for multicolor Ramsey numbers (2020) (18)
Online Ramsey Numbers and the Subgraph Query Problem (2018) (18)
Cycle packing (2013) (17)
On the grid Ramsey problem and related questions (2014) (16)
Almost‐spanning universality in random graphs (2015) (16)
Ramsey Numbers of Books and Quasirandomness (2020) (14)
Quasirandom Cayley graphs (2016) (14)
The Ramsey number of dense graphs (2009) (13)
A Sequence of Triangle-Free Pseudorandom Graphs (2016) (13)
A new bound for the Brown-Erdős-Sós problem (2019) (12)
The regularity method for graphs with few 4‐cycles (2020) (12)
Monochromatic Cycle Partitions in Local Edge Colorings (2014) (12)
Hypergraph expanders of all uniformities from Cayley graphs (2018) (12)
Large almost monochromatic subsets in hypergraphs (2009) (11)
On the Existence of Rainbow 4-Term Arithmetic Progressions (2007) (11)
Repeated Patterns in Proper Colorings (2020) (11)
Hypergraph expanders from Cayley graphs (2017) (10)
Hypergraph cuts above the average (2018) (10)
Hedgehogs are not colour blind (2015) (10)
Erdos-Hajnal-type theorems in hypergraphs (2011) (10)
Large subgraphs without complete bipartite graphs (2014) (9)
Distinct Volume Subsets (2014) (9)
Rainbow solutions of linear equations over Zp (2006) (8)
Ramsey numbers of cubes versus cliques (2012) (8)
Hereditary quasirandomness without regularity (2016) (8)
The size‐Ramsey number of cubic graphs (2021) (7)
Sidorenko's conjecture for higher tree decompositions (2018) (7)
Short proofs of some extremal results III (2019) (6)
A Note on Induced Ramsey Numbers (2016) (6)
Extremal Numbers of Cycles Revisited (2020) (5)
Tower-type bounds for unavoidable patterns in words (2017) (5)
Lines in Euclidean Ramsey Theory (2017) (5)
Some remarks on the Zarankiewicz problem (2020) (4)
On the size-Ramsey number of grids (2022) (4)
Intervals in the Hales-Jewett theorem (2018) (3)
Ramsey numbers of trails and circuits (2021) (3)
Off-diagonal book Ramsey numbers (2021) (3)
Essays in extremal combinatorics (2012) (3)
Linear forms from the Gowers uniformity norm (2013) (3)
Three Early Problems on Size Ramsey Numbers (2021) (3)
Ramsey games near the critical threshold (2019) (2)
Books versus Triangles at the Extremal Density (2019) (2)
Random multilinear maps and the Erdős box problem (2021) (2)
Rational exponents near two (2022) (2)
Size Ramsey numbers of triangle-free graphs with bounded degree (2016) (2)
Inevitable randomness in discrete mathematics (University Lecture Series 49) (2011) (2)
Two extensions of Ramsey's theorem (2011) (2)
A New Bound for the Brown--Erd\H{o}s--S\'os Problem. (2019) (2)
Sidorenko's conjecture for a class of graphs: an exposition (2012) (2)
Independent arithmetic progressions (2019) (2)
Threshold Ramsey multiplicity for odd cycles (2021) (1)
Threshold Ramsey multiplicity for paths and even cycles (2021) (1)
Sums of linear transformations (2022) (1)
Subset sums, completeness and colorings (2021) (1)
Graph Ramsey theory (2018) (1)
Freiman homomorphisms on sparse random sets (2016) (1)
Hypergraph Ramsey numbers of cliques versus stars (2022) (1)
Set-coloring Ramsey numbers via codes (2022) (1)
Which graphs can be counted in $C_4$-free graphs? (2021) (1)
The Green-tao Theorem (2014) (1)
Monochromatic components with many edges (2022) (1)
Monochromatic combinatorial lines of length three (2018) (1)
A note on lower bounds for hypergraph Ramsey numbers (2007) (0)
On the KŁR conjecture in random graphs (2014) (0)
C O ] 8 F eb 2 01 9 On the extremal number of subdivisions (2019) (0)
More on lines in Euclidean Ramsey theory (2022) (0)
Domination inequalities and dominating graphs (2023) (0)
Repeated Patterns in Arbitrary Colorings in Projective Over Finite Numbers of Real Cyclotomic Fields, Principal Ideals, and Primes (2022) (0)
Random multilinear maps and the Erd\H{o}s box problem (2020) (0)
C O ] 2 6 Ju l 2 01 8 Intervals in the Hales – Jewett theorem (2018) (0)
C O ] 1 8 O ct 2 01 9 Short proofs of some extremal results III (2019) (0)
Ramsey numbers of cubes versus cliques Citation (2013) (0)
A relative Szemerédi theorem (2015) (0)
Almost-spanning universality in random graphs (Extended abstract) (2015) (0)
Sums of transcendental dilates (2022) (0)
Lines in Euclidean Ramsey Theory (2018) (0)
C O ] 1 3 D ec 2 01 3 Ramsey numbers of cubes versus cliques (2013) (0)
Cycle Packing Terms of Use Cycle Packing (2014) (0)
TITLES AND ABSTRACTS OF TALKS FOR THE ANNUAL IMS MEETING, APRIL 15-16, 2016 (2016) (0)
Difference sets in $\mathbb{R}^d$ (2021) (0)
C O ] 1 3 M ay 2 01 9 Books versus triangles at the extremal density (2019) (0)
2 Induced forests in sparse bipartite graphs (2013) (0)
Pseudorandom graphs David Conlon What is a pseudorandom graph ? (2016) (0)
On the Ramsey multiplicity of complete graphs (2012) (0)
Bounds for graph regularity and removal lemmas (2012) (0)
MONOCHROMATIC CYCLE PARTITIONS IN LOCAL (2015) (0)
The upper logarithmic density of monochromatic subset sums (2021) (0)
Ramsey numbers of cubes versus cliques (2014) (0)
Fixing a hole (2021) (0)
On two problems in graph Ramsey theory (2012) (0)

This paper list is powered by the following services:

Other Resources About David Conlon

en.wikipedia.org

What Schools Are Affiliated With David Conlon?

David Conlon is affiliated with the following schools: