Conlon, David

Combined from CaltechAUTHORS

• Conlon, David and Lim, Jeck (2023) Sums of transcendental dilates; Bulletin of the London Mathematical Society; 10.1112/blms.12870
• Conlon, David and Nenadov, Rajko, et el. (2023) On the size-Ramsey number of grids; Combinatorics, Probability and Computing; 10.1017/s0963548323000147
• Conlon, David and Gishboliner, Lior, et el. (2023) A new bound for the Brown-Erdős-Sós problem; Journal of Combinatorial Theory. Series B; Vol. 158; No. 2; 1-35; 10.1016/j.jctb.2022.08.005
• Conlon, David and Fox, Jacob, et el. (2023) Threshold Ramsey multiplicity for paths and even cycles; European Journal of Combinatorics; Vol. 107; Art. No. 103612; 10.1016/j.ejc.2022.103612
• Conlon, David and Fox, Jacob, et el. (2022) The upper logarithmic density of monochromatic subset sums; Mathematika; Vol. 68; No. 4; 1292-1301; 10.1112/mtk.12167
• Conlon, David and Fox, Jacob, et el. (2022) Threshold Ramsey multiplicity for odd cycles; Revista de la Unión Matemática Argentina; Vol. 64; No. 1; 49-68; 10.33044/revuma.2874
• Conlon, David and Tyomkyn, Mykhaylo (2022) Ramsey numbers of trails and circuits; Journal of Graph Theory; 10.1002/jgt.22865
• Conlon, David and Nenadov, Rajko, et el. (2022) The size‐Ramsey number of cubic graphs; Bulletin of the London Mathematical Society; 10.1112/blms.12682
• Conlon, David (2022) Some remarks on the Zarankiewicz problem; Mathematical Proceedings of the Cambridge Philosophical Society; Vol. 173; No. 1; 155-161; 10.1017/S0305004121000475
• Conlon, David (2022) Monochromatic combinatorial lines of length three; Proceedings of the American Mathematical Society; Vol. 150; No. 1; 1-4; 10.1090/proc/15739
• Conlon, David and Fox, Jacob, et el. (2022) Which graphs can be counted in C₄-free graphs?; Pure and Applied Mathematics Quarterly; Vol. 18; No. 6; 2413-2432; 10.4310/pamq.2022.v18.n6.a4
• Conlon, David and Fox, Jacob, et el. (2021) The regularity method for graphs with few 4-cycles; Journal of the London Mathematical Society; Vol. 104; No. 5; 2376-2401; 10.1112/jlms.12500
• Conlon, David and Tyomkyn, Mykhaylo (2021) Repeated Patterns in Proper Colorings; SIAM Journal on Discrete Mathematics; Vol. 35; No. 3; 2249-2264; 10.1137/21M1414103
• Conlon, David and Pohoata, Cosmin, et el. (2021) Random Multilinear Maps and the Erdős Box Problem; Discrete Analysis; Vol. 2021; Art. No. 17; 10.19086/da.28336
• Conlon, David and Janzer, Oliver, et el. (2021) More on the extremal number of subdivisions; Combinatorica; Vol. 41; No. 4; 465-494; 10.1007/s00493-020-4202-1
• Conlon, David and Fox, Jacob, et el. (2021) Which graphs can be counted in C₄-free graphs?
• Conlon, David (2021) Extremal Numbers of Cycles Revisited; American Mathematical Monthly; Vol. 128; No. 5; 464-466; 10.1080/00029890.2021.1886845
• Conlon, David and Ferber, Asaf (2021) Lower bounds for multicolor Ramsey numbers; Advances in Mathematics; Vol. 378; Art. No. 107528; 10.1016/j.aim.2020.107528
• Conlon, David and Fox, Jacob, et el. (2020) Short proofs of some extremal results III; Random Structures & Algorithms; Vol. 57; No. 4; 958-982; 10.1002/rsa.20953
• Conlon, David and Das, Shagnik, et el. (2020) Ramsey games near the critical threshold; Random Structures and Algorithms; Vol. 57; No. 4; 940-957; 10.1002/rsa.20959
• Conlon, David and Tidor, Jonathan, et el. (2020) Hypergraph expanders of all uniformities from Cayley graphs; Proceedings of the London Mathematical Society; Vol. 121; No. 5; 1311-1336; 10.1112/plms.12371
• Conlon, David and Gishboliner, Lior, et el. (2020) A New Bound for the Brown-Erdős-Sós Problem; 10.48550/arXiv.1912.08834
• Conlon, David and Fox, Jacob, et el. (2020) Ramsey Numbers of Books and Quasirandomness; Combinatorica; 10.1007/s00493-021-4409-9
• Conlon, David and Fox, Jacob, et el. (2020) Books versus triangles at the extremal density; SIAM Journal on Discrete Mathematics; Vol. 34; No. 1; 385-398; 10.1137/19M1261766
• Conlon, David and Kim, Jeong Han, et el. (2019) Sidorenko's conjecture for higher tree decompositions
• Conlon, David and Lee, Joonkyung (2019) Sidorenko's conjecture for blow-ups; 10.48550/arXiv.1809.01259
• Conlon, David and Fox, Jacob, et el. (2019) Independent arithmetic progressions; 10.48550/arXiv.1901.05084
• Conlon, David (2019) A note on lower bounds for hypergraph Ramsey numbers; 10.48550/arXiv.0711.5004
• Conlon, David and Fox, Jacob, et el. (2019) Linear forms from the Gowers uniformity norm; 10.48550/arXiv.1305.5565
• Conlon, David and Fox, Jacob, et el. (2019) Large subgraphs without complete bipartite graphs; 10.48550/arXiv.1401.6711
• Conlon, David (2019) Hypergraph expanders from Cayley graphs; 10.48550/arXiv.1709.10006
• Conlon, David (2019) Graphs with few paths of prescribed length between any two vertices; 10.48550/arXiv.1411.0856
• Conlon, David and Fox, Jacob, et el. (2019) Online Ramsey Numbers and the Subgraph Query Problem; 10.48550/arXiv.1806.09726
• Conlon, David and Fox, Jacob, et el. (2019) Hypergraph cuts above the average; 10.48550/arXiv.1803.08462
• Conlon, David (2019) The Ramsey number of books; 10.48550/arXiv.1808.03157
• Conlon, David and Lee, Joonkyung (2019) On the extremal number of subdivisions; 10.48550/arXiv.1807.05008
• Conlon, David and Fox, Jacob, et el. (2019) Hedgehogs are not colour blind; 10.48550/arXiv.1511.00563
• Conlon, David and Kamčev, Nina (2019) Intervals in the Hales-Jewett theorem; 10.48550/arXiv.1801.08919
• Conlon, David and Fox, Jacob, et el. (2019) Sidorenko's conjecture for a class of graphs: an exposition; 10.48550/arXiv.1209.0184
• Conlon, David and Fox, Jacob, et el. (2019) Tower-type bounds for unavoidable patterns in words; Transactions of the American Mathematical Society; 10.1090/tran/7751
• Conlon, David and Fox, Jacob (2019) Lines in Euclidean Ramsey Theory; Discrete and Computational Geometry; Vol. 61; No. 1; 218-225; 10.1007/s00454-018-9980-5
• Conlon, David and Kim, Jeong Han, et el. (2018) Some advances on Sidorenko's conjecture; Journal of the London Mathematical Society; Vol. 98; No. 3; 593-608; 10.1112/jlms.12142
• Aigner-Horev, Elad and Conlon, David, et el. (2018) Quasirandomness in Hypergraphs; Electronic Journal of Combinatorics; Vol. 25; No. 3; Art. No. P3.34
• Conlon, David and Fox, Jacob, et el. (2018) Hereditary quasirandomness without regularity; Mathematical Proceedings of the Cambridge Philosophical Society; Vol. 164; No. 3; 385-399; 10.1017/s0305004116001055
• Bukh, Boris and Conlon, David (2018) Rational exponents in extremal graph theory; Journal of the European Mathematical Society; Vol. 20; No. 7; 1747-1757; 10.4171/jems/798
• Aigner-Horev, Elad and Conlon, David, et el. (2017) Quasirandomness in hypergraphs; Electronic Notes in Discrete Mathematics; Vol. 61; 13-19; 10.1016/j.endm.2017.06.015
• Conlon, David and Lee, Joonkyung (2017) Finite reflection groups and graph norms; Advances in Mathematics; Vol. 315; 130-165; 10.1016/j.aim.2017.05.009
• Conlon, David and Dellamonica, Domingos, et el. (2017) A Note on Induced Ramsey Numbers; ISBN 9783319444789; A Journey Through Discrete Mathematics; 357-366; 10.1007/978-3-319-44479-6_13
• Conlon, David and Ferber, Asaf, et el. (2017) Almost-spanning universality in random graphs; Random Structures & Algorithms; Vol. 50; No. 3; 380-393; 10.1002/rsa.20661
• Conlon, David and Zhao, Yufei (2017) Quasirandom Cayley graphs; Discrete Analysis; Art. No. 6; 10.19086/da.1294
• Conlon, David (2017) A Sequence of Triangle-Free Pseudorandom Graphs; Combinatorics, Probability and Computing; Vol. 26; No. 2; 195-200; 10.1017/s0963548316000298
• Conlon, D. and Gowers, W. T. (2017) Freiman homomorphisms on sparse random sets; Quarterly Journal of Mathematics; Vol. 68; No. 1; 275-300; 10.1093/qmath/haw058
• Conlon, David and Fox, Jacob, et el. (2017) Ordered Ramsey numbers; Journal of Combinatorial Theory, Series B; Vol. 122; 353-383; 10.1016/j.jctb.2016.06.007
• Conlon, David and Fox, Jacob, et el. (2016) Short proofs of some extremal results II; Journal of Combinatorial Theory, Series B; Vol. 121; 173-196; 10.1016/j.jctb.2016.03.005
• Conlon, D. and Gowers, W. T. (2016) Combinatorial theorems in sparse random sets; Annals of Mathematics; Vol. 184; No. 2; 367-454; 10.4007/annals.2016.184.2.2
• Conlon, David and Stein, Maya (2016) Monochromatic Cycle Partitions in Local Edge Colorings; Journal of Graph Theory; Vol. 81; No. 2; 134-145; 10.1002/jgt.21867
• Conlon, David and Fox, Jacob, et el. (2016) Ramsey numbers of cubes versus cliques; Combinatorica; Vol. 36; No. 1; 37-70; 10.1007/s00493-014-3010-x
• Conlon, David and Ferber, Asaf, et el. (2015) Almost-spanning universality in random graphs (Extended abstract); Electronic Notes in Discrete Mathematics; Vol. 49; 203-211; 10.1016/j.endm.2015.06.030
• Conlon, David and Fox, Jacob, et el. (2015) On the Grid Ramsey Problem and Related Questions; International Mathematics Research Notices; Vol. 2015; No. 17; 8052-8084; 10.1093/imrn/rnu190
• Conlon, David (2015) Rational exponents in extremal graph theory; 10.14288/1.0228183
• Conlon, David and Fox, Jacob, et el. (2015) Recent developments in graph Ramsey theory; ISBN 9781316106853; Surveys in Combinatorics 2015; 49-118; 10.1017/cbo9781316106853.003
• Conlon, David and Fox, Jacob, et el. (2015) A relative Szemerédi theorem; Geometric and Functional Analysis; Vol. 25; No. 3; 733-762; 10.1007/s00039-015-0324-9
• Conlon, David and Fox, Jacob, et el. (2015) Distinct Volume Subsets; SIAM Journal on Discrete Mathematics; Vol. 29; No. 1; 472-480; 10.1137/140954519
• Conlon, David and Fox, Jacob, et el. (2015) The Erdős-Gyárfás problem on generalized Ramsey numbers; Proceedings of the London Mathematical Society; Vol. 110; No. 1; 1-18; 10.1112/plms/pdu049
• Conlon, David and Fox, Jacob, et el. (2014) Cycle packing; Random Structures & Algorithms; Vol. 45; No. 4; 608-626; 10.1002/rsa.20574
• Conlon, D. and Gowers, W. T., et el. (2014) On the KŁR conjecture in random graphs; Israel Journal of Mathematics; Vol. 203; No. 1; 535-580; 10.1007/s11856-014-1120-1
• Conlon, David and Fox, Jacob, et el. (2014) Ramsey-type results for semi-algebraic relations; Transactions of the American Mathematical Society; Vol. 366; No. 9; 5043-5065; 10.1090/s0002-9947-2014-06179-5
• Conlon, David and Fox, Jacob, et el. (2014) Extremal results in sparse pseudorandom graphs; Advances in Mathematics; Vol. 256; 206-290; 10.1016/j.aim.2013.12.004
• Conlon, David and Fox, Jacob, et el. (2014) Short Proofs of Some Extremal Results; Combinatorics, Probability and Computing; Vol. 23; No. 1; 8-28; 10.1017/s0963548313000448
• Conlon, David and Fox, Jacob, et el. (2014) The Green-Tao theorem: an exposition; EMS Surveys in Mathematical Sciences; Vol. 1; No. 2; 249-282; 10.4171/emss/6
• Conlon, David (2014) Combinatorial theorems relative to a random set; ISBN 9788961058070; Proceedings of the International Congress of Mathematicians; 303-327; 10.48550/arXiv.1404.3324
• Conlon, David and Fox, Jacob, et el. (2013) Two extensions of Ramsey's theorem; Duke Mathematical Journal; Vol. 162; No. 15; 2903-2927; 10.1215/00127094-2382566
• Conlon, David and Fox, Jacob (2013) Graph removal lemmas; ISBN 9781139506748; Surveys in Combinatorics 2013; 1-50; 10.1017/cbo9781139506748.002
• Conlon, David and Fox, Jacob, et el. (2013) An improved bound for the stepping-up lemma; Discrete Applied Mathematics; Vol. 161; No. 9; 1191-1196; 10.1016/j.dam.2010.10.013
• Conlon, David (2013) The Ramsey number of dense graphs; Bulletin of the London Mathematical Society; Vol. 45; No. 3; 483-496; 10.1112/blms/bds097
• Conlon, David and Fox, Jacob (2012) Bounds for graph regularity and removal lemmas; Geometric and Functional Analysis; Vol. 22; No. 5; 1191-1256; 10.1007/s00039-012-0171-x
• Conlon, David and Fox, Jacob, et el. (2012) Erdős-Hajnal-type theorems in hypergraphs; Journal of Combinatorial Theory, Series B; Vol. 102; No. 5; 1142-1154; 10.1016/j.jctb.2012.05.005
• Conlon, David and Fox, Jacob, et el. (2012) On two problems in graph Ramsey theory; Combinatorica; Vol. 32; No. 5; 513-535; 10.1007/s00493-012-2710-3
• Conlon, David (2012) On the Ramsey multiplicity of complete graphs; Combinatorica; Vol. 32; No. 2; 171-186; 10.1007/s00493-012-2465-x
• Conlon, David and Hàn, Hiêp, et el. (2012) Weak quasi-randomness for uniform hypergraphs; Random Structures & Algorithms; Vol. 40; No. 1; 1-38; 10.1002/rsa.20389
• Conlon, David (2011) Inevitable randomness in discrete mathematics [Book Review]; Bulletin of the London Mathematical Society; Vol. 43; No. 5; 1021-1023; 10.1112/blms/bdr063
• Conlon, David and Fox, Jacob, et el. (2011) Large almost monochromatic subsets in hypergraphs; Israel Journal of Mathematics; Vol. 181; No. 1; 423-432; 10.1007/s11856-011-0016-6
• Conlon, David and Fox, Jacob, et el. (2010) An Approximate Version of Sidorenko's Conjecture; Geometric and Functional Analysis; Vol. 20; No. 6; 1354-1366; 10.1007/s00039-010-0097-0
• Conlon, David (2010) An Extremal Theorem in the Hypercube; Electronic Journal of Combinatorics; Vol. 17; Art. No. R111; 10.48550/arXiv.1005.0582
• Conlon, David and Fox, Jacob, et el. (2010) Hypergraph Ramsey numbers; Journal of the American Mathematical Society; Vol. 23; No. 1; 247-266; 10.1090/s0894-0347-09-00645-6
• Conlon, David (2009) On-line Ramsey Numbers; SIAM Journal on Discrete Mathematics; Vol. 23; No. 4; 1954-1963; 10.1137/090749220
• Conlon, David (2009) Hypergraph Packing and Sparse Bipartite Ramsey Numbers; Combinatorics, Probability and Computing; Vol. 18; No. 6; 913-923; 10.1017/s0963548309990174
• Conlon, David (2009) A new upper bound for diagonal Ramsey numbers; Annals of Mathematics; Vol. 170; No. 2; 941-960; 10.4007/annals.2009.170.941
• Conlon, David and Fox, Jacob, et el. (2009) Ramsey numbers of sparse hypergraphs; Random Structures & Algorithms; Vol. 35; No. 1; 1-14; 10.1002/rsa.20260
• Conlon, David (2008) A new upper bound for the bipartite Ramsey problem; Journal of Graph Theory; Vol. 58; No. 4; 351-356; 10.1002/jgt.20317
• Conlon, David and Jungić, Veselin, et el. (2007) On the Existence of Rainbow 4-Term Arithmetic Progressions; Graphs and Combinatorics; Vol. 23; No. 3; 249-254; 10.1007/s00373-007-0723-2
• Conlon, David (2006) Rainbow solutions of linear equations over ℤ_p; Discrete Mathematics; Vol. 306; No. 17; 2056-2063; 10.1016/j.disc.2006.03.070