Andrew J. Uzzell

According to our database1, Andrew J. Uzzell authored at least 13 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers.
J. Graph Theory, September, 2023

2020
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
J. Graph Theory, 2020

On difference graphs and the local dimension of posets.
Eur. J. Comb., 2020

Regular colorings in regular graphs.
Discuss. Math. Graph Theory, 2020

A Simple Proof for a Forbidden Subposet Problem.
Electron. J. Comb., 2020

2019
Multicolor containers, extremal entropy, and counting.
Random Struct. Algorithms, 2019

An Improved Upper Bound for Bootstrap Percolation in All Dimensions.
Comb. Probab. Comput., 2019

2017
On String Graph Limits and the Structure of a Typical String Graph.
J. Graph Theory, 2017

2015
The time of bootstrap percolation with dense initial sets for all thresholds.
Random Struct. Algorithms, 2015

Strong Turán stability.
Electron. Notes Discret. Math., 2015

Monotone Cellular Automata in a Random Environment.
Comb. Probab. Comput., 2015

2014
On the Typical Structure of Graphs in a Monotone Property.
Electron. J. Comb., 2014

2013
A Turán-Type Problem on Distances in Graphs.
Graphs Comb., 2013


  Loading...