Skip to content
Preprint

A non-trivial bound for 3AP-intersecting families

Sep 2026 · 1 citation · 5 references
Mathematics

Abstract

A family $F$ of subsets of $[n]$ is 3AP-intersecting if every two members have intersection containing a non-trivial three-term arithmetic progression. We prove that there is an absolute constant $c>0$ such that any such $F$ has size at most $(\tfrac12 - c)2^n$. This is the first non-trivial progress towards a conjecture of Simonovits and S\'os that the maximum possible size is $2^{n-3}$. More generally, we show the same bound for $H$-intersecting families whenever $H$ is a $3$-graph on $[n]$ with bounded codegrees. A clique shows that this is sharp, in that the bounded codegree assumption cannot be removed.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.