David Conlon

Orcid: 0000-0001-5899-1829

According to our database1, David Conlon authored at least 48 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fixing a Hole.
Discret. Comput. Geom., December, 2023

On the size-Ramsey number of grids.
Comb. Probab. Comput., November, 2023

Hypergraph Ramsey numbers of cliques versus stars.
Random Struct. Algorithms, October, 2023

Three Early Problems on Size Ramsey Numbers.
Comb., August, 2023

Off-diagonal book Ramsey numbers.
Comb. Probab. Comput., May, 2023

Ramsey numbers of trails and circuits.
J. Graph Theory, 2023

A new bound for the Brown-Erdős-Sós problem.
J. Comb. Theory, Ser. B, 2023

Threshold Ramsey multiplicity for paths and even cycles.
Eur. J. Comb., 2023

Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold.
CoRR, 2023

2022
Ramsey Numbers of Books and Quasirandomness.
Comb., 2022

2021
Extremal Numbers of Cycles Revisited.
Am. Math. Mon., 2021

Repeated Patterns in Proper Colorings.
SIAM J. Discret. Math., 2021

More on the Extremal Number of Subdivisions.
Comb., 2021

2020
Books versus Triangles at the Extremal Density.
SIAM J. Discret. Math., 2020

Short proofs of some extremal results III.
Random Struct. Algorithms, 2020

Ramsey games near the critical threshold.
Random Struct. Algorithms, 2020

2019
Lines in Euclidean Ramsey Theory.
Discret. Comput. Geom., 2019

2018
Some advances on Sidorenko's conjecture.
J. Lond. Math. Soc., 2018

2017
Almost-spanning universality in random graphs.
Random Struct. Algorithms, 2017

Ordered Ramsey numbers.
J. Comb. Theory, Ser. B, 2017

Quasirandomness in hypergraphs.
Electron. Notes Discret. Math., 2017

A Sequence of Triangle-Free Pseudorandom Graphs.
Comb. Probab. Comput., 2017

2016
Monochromatic Cycle Partitions in Local Edge Colorings.
J. Graph Theory, 2016

Short proofs of some extremal results II.
J. Comb. Theory, Ser. B, 2016

Ramsey numbers of cubes versus cliques.
Comb., 2016

2015
Distinct Volume Subsets.
SIAM J. Discret. Math., 2015

Almost-spanning universality in random graphs (Extended abstract).
Electron. Notes Discret. Math., 2015

Recent developments in graph Ramsey theory.
Proceedings of the Surveys in Combinatorics 2015, 2015

2014
Cycle packing.
Random Struct. Algorithms, 2014

Short Proofs of Some Extremal Results.
Comb. Probab. Comput., 2014

2013
An improved bound for the stepping-up lemma.
Discret. Appl. Math., 2013

Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Graph removal lemmas.
Proceedings of the Surveys in Combinatorics 2013, 2013

2012
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms, 2012

Erdős-Hajnal-type theorems in hypergraphs.
J. Comb. Theory, Ser. B, 2012

Graph removal lemmas
CoRR, 2012

Extremal results in sparse pseudorandom graphs
CoRR, 2012

On two problems in graph Ramsey theory.
Comb., 2012

On the Ramsey multiplicity of complete graphs.
Comb., 2012

2011
Two extensions of Ramsey's theorem
CoRR, 2011

Bounds for graph regularity and removal lemmas
CoRR, 2011

2010
An Extremal Theorem in the Hypercube.
Electron. J. Comb., 2010

2009
On-line Ramsey Numbers.
SIAM J. Discret. Math., 2009

Ramsey numbers of sparse hypergraphs.
Random Struct. Algorithms, 2009

Hypergraph Packing and Sparse Bipartite Ramsey Numbers.
Comb. Probab. Comput., 2009

2008
A new upper bound for the bipartite Ramsey problem.
J. Graph Theory, 2008

2007
On the Existence of Rainbow 4-Term Arithmetic Progressions.
Graphs Comb., 2007

2006
Rainbow solutions of linear equations over Z<sub>p</sub>.
Discret. Math., 2006


  Loading...