Sam van der Poel

collaborators

3 papers

math.CO2026

Excluding an induced star in dense random graphs

Sam van der Poel

For fixed $k \geq 3$ , we study the asymptotic number and typical structure of dense graphs with no induced copy of the star $K_{1, k}$ . We solve the associated graphon variational pro…

cs.DS2026

Spectral recovery of a planted triangle-dense subgraph

Sam van der Poel, Cheng Mao, Benjamin McKenna

Given a simple graph on $n$ vertices and a parameter $k$ , the triangle-densest- $k$ -subgraph problem is known to be computationally hard in the worst case. To circumvent the computa…

math.CO2025

The typical structure of dense claw-free graphs

Will Perkins, Sam van der Poel

We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarit…