most citedLower tails for triangles inside the critical window

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2025

A new lower bound for the Ramsey numbers

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the uppe…

math.PR2024★ 1 cited

Lower tails for triangles inside the critical window

Matthew Jenssen, Will Perkins, Aditya Potukuchi +1

We study the probability that the random graph is triangle-free. When or the asymptotics of the logarithm of this probability are known…

cs.DS2024

Sampling and counting triangle-free graphs near the critical density

Matthew Jenssen, Will Perkins, Aditya Potukuchi +1

We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erdős-Rényi random graph conditioned on triangle-freeness? Can we e…