Skip to content

Erdős problem 272

Let N1N\geq 1. What is the largest tt such that there are A1,,At{1,,N}A_1,\ldots,A_t\subseteq \{1,\ldots,N\} with AiAjA_i\cap A_j a non-empty arithmetic progression for all iji\neq j?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/272.lean

Formal Conjectures

FormalConjectures/ErdosProblems/272.leanErdos272.erdos_2721 lineExact file
Asymptotics.IsEquivalent Filter.atTop (fun N => ↑(Erdos272.maxArithInterCard N)) sorry
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page