<h1>Conlon, David</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Conlon, David and Lim, Jeck (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230725-500420000.2">Sums of transcendental dilates</a>; Bulletin of the London Mathematical Society; <a href="https://doi.org/10.1112/blms.12870">10.1112/blms.12870</a></li>
<li>Conlon, David and Nenadov, Rajko, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230717-55915200.33">On the size-Ramsey number of grids</a>; Combinatorics, Probability and Computing; <a href="https://doi.org/10.1017/s0963548323000147">10.1017/s0963548323000147</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221011-128968500.8">Threshold Ramsey multiplicity for paths and even cycles</a>; European Journal of Combinatorics; Vol. 107; Art. No. 103612; <a href="https://doi.org/10.1016/j.ejc.2022.103612">10.1016/j.ejc.2022.103612</a></li>
<li>Conlon, David and Gishboliner, Lior, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221031-575177800.7">A new bound for the Brown-Erdős-Sós problem</a>; Journal of Combinatorial Theory. Series B; Vol. 158; No. 2; 1-35; <a href="https://doi.org/10.1016/j.jctb.2022.08.005">10.1016/j.jctb.2022.08.005</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221017-10817000.4">The upper logarithmic density of monochromatic subset sums</a>; Mathematika; Vol. 68; No. 4; 1292-1301; <a href="https://doi.org/10.1112/mtk.12167">10.1112/mtk.12167</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221107-997760900.3">Threshold Ramsey multiplicity for odd cycles</a>; Revista de la Unión Matemática Argentina; Vol. 64; No. 1; 49-68; <a href="https://doi.org/10.33044/revuma.2874">10.33044/revuma.2874</a></li>
<li>Conlon, David and Tyomkyn, Mykhaylo (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220726-997455000">Ramsey numbers of trails and circuits</a>; Journal of Graph Theory; <a href="https://doi.org/10.1002/jgt.22865">10.1002/jgt.22865</a></li>
<li>Conlon, David and Nenadov, Rajko, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220718-901273500">The size‐Ramsey number of cubic graphs</a>; Bulletin of the London Mathematical Society; <a href="https://doi.org/10.1112/blms.12682">10.1112/blms.12682</a></li>
<li>Conlon, David (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200914-085046091">Some remarks on the Zarankiewicz problem</a>; Mathematical Proceedings of the Cambridge Philosophical Society; Vol. 173; No. 1; 155-161; <a href="https://doi.org/10.1017/S0305004121000475">10.1017/S0305004121000475</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200914-140122041">Ramsey Numbers of Books and Quasirandomness</a>; Combinatorica; <a href="https://doi.org/10.1007/s00493-021-4409-9">10.1007/s00493-021-4409-9</a></li>
<li>Conlon, David (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170936221">Monochromatic combinatorial lines of length three</a>; Proceedings of the American Mathematical Society; Vol. 150; No. 1; 1-4; <a href="https://doi.org/10.1090/proc/15739">10.1090/proc/15739</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230515-296699000.2">Which graphs can be counted in C₄-free graphs?</a>; Pure and Applied Mathematics Quarterly; Vol. 18; No. 6; 2413-2432; <a href="https://doi.org/10.4310/pamq.2022.v18.n6.a4">10.4310/pamq.2022.v18.n6.a4</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200914-101307280">The regularity method for graphs with few 4-cycles</a>; Journal of the London Mathematical Society; Vol. 104; No. 5; 2376-2401; <a href="https://doi.org/10.1112/jlms.12500">10.1112/jlms.12500</a></li>
<li>Conlon, David and Tyomkyn, Mykhaylo (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200914-134941914">Repeated Patterns in Proper Colorings</a>; SIAM Journal on Discrete Mathematics; Vol. 35; No. 3; 2249-2264; <a href="https://doi.org/10.1137/21M1414103">10.1137/21M1414103</a></li>
<li>Conlon, David and Pohoata, Cosmin, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211105-180659290">Random Multilinear Maps and the Erdős Box Problem</a>; Discrete Analysis; Vol. 2021; Art. No. 17; <a href="https://doi.org/10.19086/da.28336">10.19086/da.28336</a></li>
<li>Conlon, David and Janzer, Oliver, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170943053">More on the extremal number of subdivisions</a>; Combinatorica; Vol. 41; No. 4; 465-494; <a href="https://doi.org/10.1007/s00493-020-4202-1">10.1007/s00493-020-4202-1</a></li>
<li>Conlon, David (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210602-132638631">Extremal Numbers of Cycles Revisited</a>; American Mathematical Monthly; Vol. 128; No. 5; 464-466; <a href="https://doi.org/10.1080/00029890.2021.1886845">10.1080/00029890.2021.1886845</a></li>
<li>Conlon, David and Ferber, Asaf (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201216-111908862">Lower bounds for multicolor Ramsey numbers</a>; Advances in Mathematics; Vol. 378; Art. No. 107528; <a href="https://doi.org/10.1016/j.aim.2020.107528">10.1016/j.aim.2020.107528</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200909-070916091">Short proofs of some extremal results III</a>; Random Structures &amp; Algorithms; Vol. 57; No. 4; 958-982; <a href="https://doi.org/10.1002/rsa.20953">10.1002/rsa.20953</a></li>
<li>Conlon, David and Das, Shagnik, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190820-162204728">Ramsey games near the critical threshold</a>; Random Structures and Algorithms; Vol. 57; No. 4; 940-957; <a href="https://doi.org/10.1002/rsa.20959">10.1002/rsa.20959</a></li>
<li>Conlon, David and Tidor, Jonathan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170932806">Hypergraph expanders of all uniformities from Cayley graphs</a>; Proceedings of the London Mathematical Society; Vol. 121; No. 5; 1311-1336; <a href="https://doi.org/10.1112/plms.12371">10.1112/plms.12371</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170946478">Books versus triangles at the extremal density</a>; SIAM Journal on Discrete Mathematics; Vol. 34; No. 1; 385-398; <a href="https://doi.org/10.1137/19M1261766">10.1137/19M1261766</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000172">Tower-type bounds for unavoidable patterns in words</a>; Transactions of the American Mathematical Society; <a href="https://doi.org/10.1090/tran/7751">10.1090/tran/7751</a></li>
<li>Conlon, David and Fox, Jacob (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959449">Lines in Euclidean Ramsey Theory</a>; Discrete and Computational Geometry; Vol. 61; No. 1; 218-225; <a href="https://doi.org/10.1007/s00454-018-9980-5">10.1007/s00454-018-9980-5</a></li>
<li>Conlon, David and Kim, Jeong Han, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958339">Some advances on Sidorenko's conjecture</a>; Journal of the London Mathematical Society; Vol. 98; No. 3; 593-608; <a href="https://doi.org/10.1112/jlms.12142">10.1112/jlms.12142</a></li>
<li>Aigner-Horev, Elad and Conlon, David, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190821-110928639">Quasirandomness in Hypergraphs</a>; Electronic Journal of Combinatorics; Vol. 25; No. 3; Art. No. P3.34</li>
<li>Conlon, David and Fox, Jacob, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959631">Hereditary quasirandomness without regularity</a>; Mathematical Proceedings of the Cambridge Philosophical Society; Vol. 164; No. 3; 385-399; <a href="https://doi.org/10.1017/s0305004116001055">10.1017/s0305004116001055</a></li>
<li>Bukh, Boris and Conlon, David (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000355">Rational exponents in extremal graph theory</a>; Journal of the European Mathematical Society; Vol. 20; No. 7; 1747-1757; <a href="https://doi.org/10.4171/jems/798">10.4171/jems/798</a></li>
<li>Aigner-Horev, Elad and Conlon, David, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000449">Quasirandomness in hypergraphs</a>; Electronic Notes in Discrete Mathematics; Vol. 61; 13-19; <a href="https://doi.org/10.1016/j.endm.2017.06.015">10.1016/j.endm.2017.06.015</a></li>
<li>Conlon, David and Lee, Joonkyung (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957357">Finite reflection groups and graph norms</a>; Advances in Mathematics; Vol. 315; 130-165; <a href="https://doi.org/10.1016/j.aim.2017.05.009">10.1016/j.aim.2017.05.009</a></li>
<li>Conlon, David and Ferber, Asaf, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000547">Almost-spanning universality in random graphs</a>; Random Structures &amp; Algorithms; Vol. 50; No. 3; 380-393; <a href="https://doi.org/10.1002/rsa.20661">10.1002/rsa.20661</a></li>
<li>Conlon, David and Zhao, Yufei (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170904052">Quasirandom Cayley graphs</a>; Discrete Analysis; Art. No. 6; <a href="https://doi.org/10.19086/da.1294">10.19086/da.1294</a></li>
<li>Conlon, David (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000736">A Sequence of Triangle-Free Pseudorandom Graphs</a>; Combinatorics, Probability and Computing; Vol. 26; No. 2; 195-200; <a href="https://doi.org/10.1017/s0963548316000298">10.1017/s0963548316000298</a></li>
<li>Conlon, D. and Gowers, W. T. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000651">Freiman homomorphisms on sparse random sets</a>; Quarterly Journal of Mathematics; Vol. 68; No. 1; 275-300; <a href="https://doi.org/10.1093/qmath/haw058">10.1093/qmath/haw058</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000833">Ordered Ramsey numbers</a>; Journal of Combinatorial Theory, Series B; Vol. 122; 353-383; <a href="https://doi.org/10.1016/j.jctb.2016.06.007">10.1016/j.jctb.2016.06.007</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000938">Short proofs of some extremal results II</a>; Journal of Combinatorial Theory, Series B; Vol. 121; 173-196; <a href="https://doi.org/10.1016/j.jctb.2016.03.005">10.1016/j.jctb.2016.03.005</a></li>
<li>Conlon, D. and Gowers, W. T. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957976">Combinatorial theorems in sparse random sets</a>; Annals of Mathematics; Vol. 184; No. 2; 367-454; <a href="https://doi.org/10.4007/annals.2016.184.2.2">10.4007/annals.2016.184.2.2</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959158">Ramsey numbers of cubes versus cliques</a>; Combinatorica; Vol. 36; No. 1; 37-70; <a href="https://doi.org/10.1007/s00493-014-3010-x">10.1007/s00493-014-3010-x</a></li>
<li>Conlon, David and Stein, Maya (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001038">Monochromatic Cycle Partitions in Local Edge Colorings</a>; Journal of Graph Theory; Vol. 81; No. 2; 134-145; <a href="https://doi.org/10.1002/jgt.21867">10.1002/jgt.21867</a></li>
<li>Conlon, David and Ferber, Asaf, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957531">Almost-spanning universality in random graphs (Extended abstract)</a>; Electronic Notes in Discrete Mathematics; Vol. 49; 203-211; <a href="https://doi.org/10.1016/j.endm.2015.06.030">10.1016/j.endm.2015.06.030</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959982">On the Grid Ramsey Problem and Related Questions</a>; International Mathematics Research Notices; Vol. 2015; No. 17; 8052-8084; <a href="https://doi.org/10.1093/imrn/rnu190">10.1093/imrn/rnu190</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959067">A relative Szemerédi theorem</a>; Geometric and Functional Analysis; Vol. 25; No. 3; 733-762; <a href="https://doi.org/10.1007/s00039-015-0324-9">10.1007/s00039-015-0324-9</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958151">Distinct Volume Subsets</a>; SIAM Journal on Discrete Mathematics; Vol. 29; No. 1; 472-480; <a href="https://doi.org/10.1137/140954519">10.1137/140954519</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959803">The Erdős-Gyárfás problem on generalized Ramsey numbers</a>; Proceedings of the London Mathematical Society; Vol. 110; No. 1; 1-18; <a href="https://doi.org/10.1112/plms/pdu049">10.1112/plms/pdu049</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001129">Cycle packing</a>; Random Structures &amp; Algorithms; Vol. 45; No. 4; 608-626; <a href="https://doi.org/10.1002/rsa.20574">10.1002/rsa.20574</a></li>
<li>Conlon, D. and Gowers, W. T., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958948">On the KŁR conjecture in random graphs</a>; Israel Journal of Mathematics; Vol. 203; No. 1; 535-580; <a href="https://doi.org/10.1007/s11856-014-1120-1">10.1007/s11856-014-1120-1</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000075">Ramsey-type results for semi-algebraic relations</a>; Transactions of the American Mathematical Society; Vol. 366; No. 9; 5043-5065; <a href="https://doi.org/10.1090/s0002-9947-2014-06179-5">10.1090/s0002-9947-2014-06179-5</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957263">Extremal results in sparse pseudorandom graphs</a>; Advances in Mathematics; Vol. 256; 206-290; <a href="https://doi.org/10.1016/j.aim.2013.12.004">10.1016/j.aim.2013.12.004</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162956937">Short Proofs of Some Extremal Results</a>; Combinatorics, Probability and Computing; Vol. 23; No. 1; 8-28; <a href="https://doi.org/10.1017/s0963548313000448">10.1017/s0963548313000448</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001431">The Green-Tao theorem: an exposition</a>; EMS Surveys in Mathematical Sciences; Vol. 1; No. 2; 249-282; <a href="https://doi.org/10.4171/emss/6">10.4171/emss/6</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959551">Two extensions of Ramsey's theorem</a>; Duke Mathematical Journal; Vol. 162; No. 15; 2903-2927; <a href="https://doi.org/10.1215/00127094-2382566">10.1215/00127094-2382566</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957165">An improved bound for the stepping-up lemma</a>; Discrete Applied Mathematics; Vol. 161; No. 9; 1191-1196; <a href="https://doi.org/10.1016/j.dam.2010.10.013">10.1016/j.dam.2010.10.013</a></li>
<li>Conlon, David (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170836067">The Ramsey number of dense graphs</a>; Bulletin of the London Mathematical Society; Vol. 45; No. 3; 483-496; <a href="https://doi.org/10.1112/blms/bds097">10.1112/blms/bds097</a></li>
<li>Conlon, David and Fox, Jacob (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959355">Bounds for graph regularity and removal lemmas</a>; Geometric and Functional Analysis; Vol. 22; No. 5; 1191-1256; <a href="https://doi.org/10.1007/s00039-012-0171-x">10.1007/s00039-012-0171-x</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957444">Erdős-Hajnal-type theorems in hypergraphs</a>; Journal of Combinatorial Theory, Series B; Vol. 102; No. 5; 1142-1154; <a href="https://doi.org/10.1016/j.jctb.2012.05.005">10.1016/j.jctb.2012.05.005</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958859">On two problems in graph Ramsey theory</a>; Combinatorica; Vol. 32; No. 5; 513-535; <a href="https://doi.org/10.1007/s00493-012-2710-3">10.1007/s00493-012-2710-3</a></li>
<li>Conlon, David (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958767">On the Ramsey multiplicity of complete graphs</a>; Combinatorica; Vol. 32; No. 2; 171-186; <a href="https://doi.org/10.1007/s00493-012-2465-x">10.1007/s00493-012-2465-x</a></li>
<li>Conlon, David and Hàn, Hiêp, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001217">Weak quasi-randomness for uniform hypergraphs</a>; Random Structures &amp; Algorithms; Vol. 40; No. 1; 1-38; <a href="https://doi.org/10.1002/rsa.20389">10.1002/rsa.20389</a></li>
<li>Conlon, David (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958247">Inevitable randomness in discrete mathematics [Book Review]</a>; Bulletin of the London Mathematical Society; Vol. 43; No. 5; 1021-1023; <a href="https://doi.org/10.1112/blms/bdr063">10.1112/blms/bdr063</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958677">Large almost monochromatic subsets in hypergraphs</a>; Israel Journal of Mathematics; Vol. 181; No. 1; 423-432; <a href="https://doi.org/10.1007/s11856-011-0016-6">10.1007/s11856-011-0016-6</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958544">An Approximate Version of Sidorenko's Conjecture</a>; Geometric and Functional Analysis; Vol. 20; No. 6; 1354-1366; <a href="https://doi.org/10.1007/s00039-010-0097-0">10.1007/s00039-010-0097-0</a></li>
<li>Conlon, David (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-163059223">An Extremal Theorem in the Hypercube</a>; Electronic Journal of Combinatorics; Vol. 17; Art. No. R111; <a href="https://doi.org/10.48550/arXiv.1005.0582">10.48550/arXiv.1005.0582</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000262">Hypergraph Ramsey numbers</a>; Journal of the American Mathematical Society; Vol. 23; No. 1; 247-266; <a href="https://doi.org/10.1090/s0894-0347-09-00645-6">10.1090/s0894-0347-09-00645-6</a></li>
<li>Conlon, David (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958058">On-line Ramsey Numbers</a>; SIAM Journal on Discrete Mathematics; Vol. 23; No. 4; 1954-1963; <a href="https://doi.org/10.1137/090749220">10.1137/090749220</a></li>
<li>Conlon, David (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959718">Hypergraph Packing and Sparse Bipartite Ramsey Numbers</a>; Combinatorics, Probability and Computing; Vol. 18; No. 6; 913-923; <a href="https://doi.org/10.1017/s0963548309990174">10.1017/s0963548309990174</a></li>
<li>Conlon, David (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957624">A new upper bound for diagonal Ramsey numbers</a>; Annals of Mathematics; Vol. 170; No. 2; 941-960; <a href="https://doi.org/10.4007/annals.2009.170.941">10.4007/annals.2009.170.941</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001597">Ramsey numbers of sparse hypergraphs</a>; Random Structures &amp; Algorithms; Vol. 35; No. 1; 1-14; <a href="https://doi.org/10.1002/rsa.20260">10.1002/rsa.20260</a></li>
<li>Conlon, David (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001317">A new upper bound for the bipartite Ramsey problem</a>; Journal of Graph Theory; Vol. 58; No. 4; 351-356; <a href="https://doi.org/10.1002/jgt.20317">10.1002/jgt.20317</a></li>
<li>Conlon, David and Jungić, Veselin, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958451">On the Existence of Rainbow 4-Term Arithmetic Progressions</a>; Graphs and Combinatorics; Vol. 23; No. 3; 249-254; <a href="https://doi.org/10.1007/s00373-007-0723-2">10.1007/s00373-007-0723-2</a></li>
<li>Conlon, David (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957077">Rainbow solutions of linear equations over ℤ_p</a>; Discrete Mathematics; Vol. 306; No. 17; 2056-2063; <a href="https://doi.org/10.1016/j.disc.2006.03.070">10.1016/j.disc.2006.03.070</a></li>
</ul>