collaborators

1 paper

math.CO2025

Sparse graph counting and Kelley-Meka bounds for binary systems

Yuval Filmus, Hamed Hatami, Kaave Hosseini +1

In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In thi…