A. Newman

collaborators

3 papers

math.CO2019

Randomized construction of complexes with large diameter

Francisco Criado, Andrew Newman

We consider the question of the largest possible combinatorial diameter among $(d - 1)$ -dimensional simplicial complexes on $n$ vertices, denoted $H_{s} (n, d)$ . Using a probabilistic c…

math.PR2019

On the complexity of random polytopes

Andrew Newman

There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of…

math.CO2015

Small dense subgraphs of a graph

Tao Jiang, Andrew Newman

Given a family $F$ of graphs, and a positive integer $n$ , the Turán number $e x (n, F)$ of $F$ is the maximum number of edges in an $n$ -vertex graph that does not…