David Conlon

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 27

Top Topics

Computationally Infeasible

Repeated Patterns

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

SIAM J. Discret. Math.

Publications

David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao
Set-Coloring Ramsey Numbers and Error-Correcting Codes Near the Zero-Rate Threshold. IEEE Trans. Inf. Theory 70 (6) (2024)
David Conlon, Rajko Nenadov, Milos Trujic
On the size-Ramsey number of grids. Comb. Probab. Comput. 32 (6) (2023)
David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold. CoRR (2023)
David Conlon, Mykhaylo Tyomkyn
Ramsey numbers of trails and circuits. J. Graph Theory 102 (1) (2023)
David Conlon, Jacob Fox, Yuval Wigderson
Three Early Problems on Size Ramsey Numbers. Comb. 43 (4) (2023)
David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory, Ser. B 158 (Part) (2023)
David Conlon, Jacob Fox, Yuval Wigderson
Off-diagonal book Ramsey numbers. Comb. Probab. Comput. 32 (3) (2023)
David Conlon, Jeck Lim
Fixing a Hole. Discret. Comput. Geom. 70 (4) (2023)
David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63 (3) (2023)
David Conlon, Jacob Fox, Benny Sudakov, Fan Wei
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107 (2023)
David Conlon, Jacob Fox, Yuval Wigderson
Ramsey Numbers of Books and Quasirandomness. Comb. 42 (3) (2022)
David Conlon, Mykhaylo Tyomkyn
Repeated Patterns in Proper Colorings. SIAM J. Discret. Math. 35 (3) (2021)
David Conlon, Joonkyung Lee, Oliver Janzer
More on the Extremal Number of Subdivisions. Comb. 41 (4) (2021)
David Conlon
Extremal Numbers of Cycles Revisited. Am. Math. Mon. 128 (5) (2021)
David Conlon, Shagnik Das, Joonkyung Lee, Tamás Mészáros
Ramsey games near the critical threshold. Random Struct. Algorithms 57 (4) (2020)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results III. Random Struct. Algorithms 57 (4) (2020)
David Conlon, Jacob Fox, Benny Sudakov
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34 (1) (2020)
David Conlon, Jacob Fox
Lines in Euclidean Ramsey Theory. Discret. Comput. Geom. 61 (1) (2019)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in Hypergraphs. Electron. J. Comb. 25 (3) (2018)
David Conlon, Jeong Han Kim, Choongbum Lee, Joonkyung Lee
Some advances on Sidorenko's conjecture. J. Lond. Math. Soc. 98 (3) (2018)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs. Random Struct. Algorithms 50 (3) (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ordered Ramsey numbers. J. Comb. Theory, Ser. B 122 (2017)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61 (2017)
David Conlon
A Sequence of Triangle-Free Pseudorandom Graphs. Comb. Probab. Comput. 26 (2) (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ramsey numbers of cubes versus cliques. Comb. 36 (1) (2016)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results II. J. Comb. Theory, Ser. B 121 (2016)
David Conlon, Maya Stein
Monochromatic Cycle Partitions in Local Edge Colorings. J. Graph Theory 81 (2) (2016)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49 (2015)
David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky
Distinct Volume Subsets. SIAM J. Discret. Math. 29 (1) (2015)
David Conlon, Jacob Fox, Benny Sudakov
Cycle packing. Random Struct. Algorithms 45 (4) (2014)
David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky
Distinct volume subsets. CoRR (2014)
David Conlon, Jacob Fox, Benny Sudakov
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23 (1) (2014)
David Conlon, Jacob Fox, Benny Sudakov
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161 (9) (2013)
David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
Ramsey-type results for semi-algebraic relations. SoCG (2013)
David Conlon, Jacob Fox, Benny Sudakov
Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory, Ser. B 102 (5) (2012)
David Conlon, Jacob Fox
Graph removal lemmas CoRR (2012)
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40 (1) (2012)
David Conlon, Jacob Fox, Benny Sudakov
On two problems in graph Ramsey theory. Comb. 32 (5) (2012)
David Conlon
On the Ramsey multiplicity of complete graphs. Comb. 32 (2) (2012)
David Conlon, Jacob Fox, Yufei Zhao
Extremal results in sparse pseudorandom graphs CoRR (2012)
David Conlon, Jacob Fox
Bounds for graph regularity and removal lemmas CoRR (2011)
David Conlon, Jacob Fox, Benny Sudakov
Erdos-Hajnal-type theorems in hypergraphs CoRR (2011)
David Conlon, Jacob Fox, Benny Sudakov
Two extensions of Ramsey's theorem CoRR (2011)
David Conlon
An Extremal Theorem in the Hypercube. Electron. J. Comb. 17 (1) (2010)
David Conlon
Hypergraph Packing and Sparse Bipartite Ramsey Numbers. Comb. Probab. Comput. 18 (6) (2009)
David Conlon
On-line Ramsey Numbers. SIAM J. Discret. Math. 23 (4) (2009)
David Conlon, Jacob Fox, Benny Sudakov
Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms 35 (1) (2009)
David Conlon
A new upper bound for the bipartite Ramsey problem. J. Graph Theory 58 (4) (2008)
David Conlon, Veselin Jungic, Rados Radoicic
On the Existence of Rainbow 4-Term Arithmetic Progressions. Graphs Comb. 23 (3) (2007)
David Conlon
. Discret. Math. 306 (17) (2006)