<h1>Conlon, David</h1>
<h2>Monograph from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Conlon, David and Fox, Jacob, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230606-676918000.2">Which graphs can be counted in C₄-free graphs?</a></li>
<li>Conlon, David and Gishboliner, Lior, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200915-144809437">A New Bound for the Brown-Erdős-Sós Problem</a>; <a href="https://doi.org/10.48550/arXiv.1912.08834">10.48550/arXiv.1912.08834</a></li>
<li>Conlon, David (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170853333">Graphs with few paths of prescribed length between any two vertices</a>; <a href="https://doi.org/10.48550/arXiv.1411.0856">10.48550/arXiv.1411.0856</a></li>
<li>Conlon, David (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170924800">The Ramsey number of books</a>; <a href="https://doi.org/10.48550/arXiv.1808.03157">10.48550/arXiv.1808.03157</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170914451">Hypergraph cuts above the average</a>; <a href="https://doi.org/10.48550/arXiv.1803.08462">10.48550/arXiv.1803.08462</a></li>
<li>Conlon, David (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170907486">Hypergraph expanders from Cayley graphs</a>; <a href="https://doi.org/10.48550/arXiv.1709.10006">10.48550/arXiv.1709.10006</a></li>
<li>Conlon, David and Lee, Joonkyung (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170921338">On the extremal number of subdivisions</a>; <a href="https://doi.org/10.48550/arXiv.1807.05008">10.48550/arXiv.1807.05008</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170939635">Independent arithmetic progressions</a>; <a href="https://doi.org/10.48550/arXiv.1901.05084">10.48550/arXiv.1901.05084</a></li>
<li>Conlon, David and Lee, Joonkyung (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170928301">Sidorenko's conjecture for blow-ups</a>; <a href="https://doi.org/10.48550/arXiv.1809.01259">10.48550/arXiv.1809.01259</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170917920">Online Ramsey Numbers and the Subgraph Query Problem</a>; <a href="https://doi.org/10.48550/arXiv.1806.09726">10.48550/arXiv.1806.09726</a></li>
<li>Conlon, David and Kamčev, Nina (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170911002">Intervals in the Hales-Jewett theorem</a>; <a href="https://doi.org/10.48550/arXiv.1801.08919">10.48550/arXiv.1801.08919</a></li>
<li>Conlon, David and Kim, Jeong Han, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190820-161459631">Sidorenko's conjecture for higher tree decompositions</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170900578">Hedgehogs are not colour blind</a>; <a href="https://doi.org/10.48550/arXiv.1511.00563">10.48550/arXiv.1511.00563</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170849884">Large subgraphs without complete bipartite graphs</a>; <a href="https://doi.org/10.48550/arXiv.1401.6711">10.48550/arXiv.1401.6711</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170846378">Linear forms from the Gowers uniformity norm</a>; <a href="https://doi.org/10.48550/arXiv.1305.5565">10.48550/arXiv.1305.5565</a></li>
<li>Conlon, David and Fox, Jacob, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170842963">Sidorenko's conjecture for a class of graphs: an exposition</a>; <a href="https://doi.org/10.48550/arXiv.1209.0184">10.48550/arXiv.1209.0184</a></li>
<li>Conlon, David (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190819-170832267">A note on lower bounds for hypergraph Ramsey numbers</a>; <a href="https://doi.org/10.48550/arXiv.0711.5004">10.48550/arXiv.0711.5004</a></li>
</ul>