A Turán-Type Problem on Distances in Graphs. - Mykhaylo Tyomkyn; Andrew J. Uzzell (Graphs Comb., 2013)

On the Typical Structure of Graphs in a Monotone Property. - Svante Janson; Andrew J. Uzzell (Electron. J. Comb., 2014)

Monotone Cellular Automata in a Random Environment. - Béla Bollobás; Paul Smith; Andrew J. Uzzell (Comb. Probab. Comput., 2015)

Strong Turán stability. - Mykhaylo Tyomkyn; Andrew J. Uzzell (Electron. Notes Discret. Math., 2015)

The time of bootstrap percolation with dense initial sets for all thresholds. - Béla Bollobás; Paul Smith; Andrew J. Uzzell (Random Struct. Algorithms, 2015)

On String Graph Limits and the Structure of a Typical String Graph. - Svante Janson; Andrew J. Uzzell (J. Graph Theory, 2017)

An Improved Upper Bound for Bootstrap Percolation in All Dimensions. - Andrew J. Uzzell (Comb. Probab. Comput., 2019)

Multicolor containers, extremal entropy, and counting. - Victor Falgas-Ravry; Kelly O'Connell; Andrew J. Uzzell (Random Struct. Algorithms, 2019)

A Simple Proof for a Forbidden Subposet Problem. - Ryan R. Martin; Abhishek Methuku; Andrew J. Uzzell; Shanise Walker (Electron. J. Comb., 2020)

Regular colorings in regular graphs. - Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Jonathan Rollin; Danny Rorabaugh; Songling Shan; Andrew J. Uzzell (Discuss. Math. Graph Theory, 2020)

On difference graphs and the local dimension of posets. - Jinha Kim; Ryan R. Martin; Tomás Masarík; Warren Shull; Heather C. Smith; Andrew J. Uzzell; Zhiyu Wang (Eur. J. Comb., 2020)

Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. - Michael Dairyko; Michael Ferrara; Bernard Lidický; Ryan R. Martin; Florian Pfender; Andrew J. Uzzell (J. Graph Theory, 2020)

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. - Victor Falgas-Ravry; Robert Hancock 002; Johanna Strömberg; Andrew J. Uzzell (J. Graph Theory, 2023)