Erdős problem 865
There exists a constant such that, for all large , if has size at least then there are distinct such that .
Sources
FormalConjectures/ErdosProblems/
865.lean
Retained formal statement
There exists a constant such that, for all large , if has size at least then there are distinct such that .
A problem of Erdős and Sós (also earlier considered by Choi, Erdős, and Szemerédi [CES75], but Erdős had forgotten this).
This is true. The linked proof gives it in the contrapositive and with the constant cleared: every triple-free satisfies for a fixed , for every rather than only for large . It also shows the threshold is sharp, by exhibiting triple-free sets of size for every divisible by .
∃ C > 0, ∀ᶠ (N : ℕ) in Filter.atTop, ∀ A ⊆ Finset.Icc 1 N, ↑A.card ≥ 5 / 8 * ↑N + C → ∃ a ∈ A, ∃ b ∈ A, ∃ c ∈ A, a ≠ b ∧ a ≠ c ∧ b ≠ c ∧ a + b ∈ A ∧ a + c ∈ A ∧ b + c ∈ A