Erdős problem 272

Let $N\geq 1$ . What is the largest $t$ such that there are $A_1,\ldots,A_t\subseteq \{1,\ldots,N\}$ with $A_i\cap A_j$ a non-empty arithmetic progression for all $i\neq j$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/272.lean

Formal Conjectures

FormalConjectures/ErdosProblems/272.leanErdos272.erdos_2721 lineExact file

1Asymptotics.IsEquivalent Filter.atTop (fun N => ↑(Erdos272.maxArithInterCard N)) sorry

OpenStatement only, no proof