All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsCombinatorics

Erdős Problem 272: Szabo Strong

Szabo asks whether the maximal tt is given by N22+O(N)\frac{N^2}{2} + O(N)

Mathematical statement

Szabo asks whether the maximal tt is given by

N22+O(N) \frac{N^2}{2} + O(N)

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_272.variants.szabo_strong

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_272.variants.szabo_strong :    (fun N  (maxArithInterCard N - N ^ 2 / 2 : )) =O[atTop] fun N :   (N : ) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References