![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
David Conlon
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]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): 4074-4078 (2024) - 2023
- [j41]David Conlon, Jacob Fox, Yuval Wigderson:
Three Early Problems on Size Ramsey Numbers. Comb. 43(4): 743-768 (2023) - [j40]David Conlon, Jacob Fox, Yuval Wigderson:
Off-diagonal book Ramsey numbers. Comb. Probab. Comput. 32(3): 516-545 (2023) - [j39]David Conlon, Rajko Nenadov
, Milos Trujic
:
On the size-Ramsey number of grids. Comb. Probab. Comput. 32(6): 874-880 (2023) - [j38]David Conlon, Jeck Lim:
Fixing a Hole. Discret. Comput. Geom. 70(4): 1551-1570 (2023) - [j37]David Conlon, Jacob Fox, Benny Sudakov, Fan Wei:
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107: 103612 (2023) - [j36]David Conlon, Lior Gishboliner
, Yevgeny Levanzov, Asaf Shapira:
A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory B 158(Part): 1-35 (2023) - [j35]David Conlon, Mykhaylo Tyomkyn:
Ramsey numbers of trails and circuits. J. Graph Theory 102(1): 194-196 (2023) - [j34]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): 610-623 (2023) - [i7]David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao:
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold. CoRR abs/2305.14132 (2023) - 2022
- [j33]David Conlon
, Jacob Fox, Yuval Wigderson:
Ramsey Numbers of Books and Quasirandomness. Comb. 42(3): 309-363 (2022) - 2021
- [j32]David Conlon
, Joonkyung Lee, Oliver Janzer:
More on the Extremal Number of Subdivisions. Comb. 41(4): 465-494 (2021) - [j31]David Conlon
, Mykhaylo Tyomkyn
:
Repeated Patterns in Proper Colorings. SIAM J. Discret. Math. 35(3): 2249-2264 (2021) - [j30]David Conlon
:
Extremal Numbers of Cycles Revisited. Am. Math. Mon. 128(5): 464-466 (2021) - 2020
- [j29]David Conlon
, Shagnik Das, Joonkyung Lee, Tamás Mészáros:
Ramsey games near the critical threshold. Random Struct. Algorithms 57(4): 940-957 (2020) - [j28]David Conlon
, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results III. Random Struct. Algorithms 57(4): 958-982 (2020) - [j27]David Conlon
, Jacob Fox, Benny Sudakov:
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34(1): 385-398 (2020)
2010 – 2019
- 2019
- [j26]David Conlon
, Jacob Fox:
Lines in Euclidean Ramsey Theory. Discret. Comput. Geom. 61(1): 218-225 (2019) - 2018
- [j25]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
:
Quasirandomness in Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j24]David Conlon
, Jeong Han Kim, Choongbum Lee, Joonkyung Lee:
Some advances on Sidorenko's conjecture. J. Lond. Math. Soc. 98(3): 593-608 (2018) - 2017
- [j23]David Conlon
:
A Sequence of Triangle-Free Pseudorandom Graphs. Comb. Probab. Comput. 26(2): 195-200 (2017) - [j22]Elad Aigner-Horev
, David Conlon
, Hiêp Hàn, Yury Person
, Mathias Schacht:
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - [j21]David Conlon
, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. J. Comb. Theory B 122: 353-383 (2017) - [j20]David Conlon
, Asaf Ferber, Rajko Nenadov
, Nemanja Skoric:
Almost-spanning universality in random graphs. Random Struct. Algorithms 50(3): 380-393 (2017) - 2016
- [j19]David Conlon
, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - [j18]David Conlon
, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results II. J. Comb. Theory B 121: 173-196 (2016) - [j17]David Conlon
, Maya Stein
:
Monochromatic Cycle Partitions in Local Edge Colorings. J. Graph Theory 81(2): 134-145 (2016) - 2015
- [j16]David Conlon
, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49: 203-211 (2015) - [j15]David Conlon
, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky:
Distinct Volume Subsets. SIAM J. Discret. Math. 29(1): 472-480 (2015) - [p2]David Conlon
, Jacob Fox, Benny Sudakov:
Recent developments in graph Ramsey theory. Surveys in Combinatorics 2015: 49-118 - 2014
- [j14]David Conlon
, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23(1): 8-28 (2014) - [j13]David Conlon
, Jacob Fox, Benny Sudakov:
Cycle packing. Random Struct. Algorithms 45(4): 608-626 (2014) - [i6]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky:
Distinct volume subsets. CoRR abs/1401.6734 (2014) - 2013
- [j12]David Conlon
, Jacob Fox, Benny Sudakov:
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161(9): 1191-1196 (2013) - [c1]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. SoCG 2013: 309-318 - [p1]David Conlon, Jacob Fox:
Graph removal lemmas. Surveys in Combinatorics 2013: 1-50 - 2012
- [j11]David Conlon
:
On the Ramsey multiplicity of complete graphs. Comb. 32(2): 171-186 (2012) - [j10]David Conlon
, Jacob Fox, Benny Sudakov:
On two problems in graph Ramsey theory. Comb. 32(5): 513-535 (2012) - [j9]David Conlon
, Jacob Fox, Benny Sudakov:
Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory B 102(5): 1142-1154 (2012) - [j8]David Conlon
, Hiêp Hàn, Yury Person
, Mathias Schacht
:
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40(1): 1-38 (2012) - [i5]David Conlon, Jacob Fox, Yufei Zhao:
Extremal results in sparse pseudorandom graphs. CoRR abs/1204.6645 (2012) - [i4]David Conlon, Jacob Fox:
Graph removal lemmas. CoRR abs/1211.3487 (2012) - 2011
- [i3]David Conlon, Jacob Fox, Benny Sudakov:
Erdos-Hajnal-type theorems in hypergraphs. CoRR abs/1104.5544 (2011) - [i2]David Conlon, Jacob Fox:
Bounds for graph regularity and removal lemmas. CoRR abs/1107.4829 (2011) - [i1]David Conlon, Jacob Fox, Benny Sudakov:
Two extensions of Ramsey's theorem. CoRR abs/1112.1548 (2011) - 2010
- [j7]David Conlon:
An Extremal Theorem in the Hypercube. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j6]David Conlon
:
Hypergraph Packing and Sparse Bipartite Ramsey Numbers. Comb. Probab. Comput. 18(6): 913-923 (2009) - [j5]David Conlon
, Jacob Fox, Benny Sudakov:
Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms 35(1): 1-14 (2009) - [j4]David Conlon
:
On-line Ramsey Numbers. SIAM J. Discret. Math. 23(4): 1954-1963 (2009) - 2008
- [j3]David Conlon
:
A new upper bound for the bipartite Ramsey problem. J. Graph Theory 58(4): 351-356 (2008) - 2007
- [j2]David Conlon
, Veselin Jungic, Rados Radoicic:
On the Existence of Rainbow 4-Term Arithmetic Progressions. Graphs Comb. 23(3): 249-254 (2007) - 2006
- [j1]David Conlon
:
Rainbow solutions of linear equations over Zp. Discret. Math. 306(17): 2056-2063 (2006)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint