Leo Versteegen

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

Packing and finding paths in sparse random graphs

Vesna Iršič, Julien Portier, Leo Versteegen

Let $G \sim G (n, p)$ be a (hidden) Erdős-Rényi random graph with $p = (1 + ε) / n$ for some fixed constant $ε > 0$ . Ferber, Krivelevich, Sudakov, and Vieira showed tha…

math.CO2021

Common and Sidorenko equations in Abelian groups

Leo Versteegen

A linear configuration is said to be common in a finite Abelian group $G$ if for every 2-coloring of $G$ the number of monochromatic instances of the configuration is at least as l…