4 papers
math.CO2026
Combinatorial theorems relative to sparse sets
David Conlon
A key theme in modern extremal combinatorics is the study of classical combinatorial theorems relative to sparse subsets of their natural settings. Here we describe some of the rec…
math.NT2026
Simultaneous popular polynomial differences over finite fields
David Conlon, Dingding Dong, Guo-Dong Hong
Green's popular difference theorem says that for every \(\varepsilon>0\), all sufficiently large primes \(p\), and every set \(A\subseteq\mathbb F_p\) of density \(α\), there exis…
math.CO2025
Sums of algebraic dilates
David Conlon, Jeck Lim
We show that if are algebraic numbers, then for all finite subsets of , w…
math.CO2025
Even cycles in graphs avoiding longer even cycles
David Conlon, Eion Mulrenin, Cosmin Pohoata
A conjecture of Verstraëte states that for any fixed there exists a positive constant such that any -free graph contains a -free subgraph wit…