R. Berkowitz

activity

20162026

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

A Local Limit Theorem for Cliques in G(n,p)

Ross Berkowitz

We prove a local limit theorem the number of $r$ -cliques in $G (n, p)$ for $p \in (0, 1)$ and $r \geq 3$ fixed constants. Our bounds hold in both the $ℓ^{\infty}$ and $ℓ^{1}$ metric. Th…

math.CO2018

Expected Chromatic Number of Random Subgraphs

Ross Berkowitz, Pat Devlin, Catherine Lee +2

Given a graph $G$ and $p \in [0, 1]$ , let $G_{p}$ denote the random subgraph of $G$ obtained by keeping each edge independently with probability $p$ . Alon, Krivelevich, and Sudokov pr…