12 citations · 12 across the 2 of their papers we have counts for
2 papers
math.CO2025
A local limit theorem for the edge counts of random induced subgraphs of a random graph
Paul Balister, Emil Powierski, Alex Scott +1
Consider a `dense' Erdős--Rényi random graph model with vertices and edges, where we assume the edge density is bounded away from 0 and 1. Fix…
math.CO2019★ 12 cited
Ramsey properties of randomly perturbed dense graphs
Emil Powierski
We investigate Ramsey properties of a random graph model in which random edges are added to a given dense graph. Specifically, we determine lower and upper bounds on the function $…