PPL 062 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.26
Prize Problem LedgerErdősPPL 062Erdős Problem #588

Permanent problem IDPPL 062

Verified openErdősconjecture

Geometry

Erdős Problem #588

Let f_k(n) be minimal such that if n points in ℝ^2 have no k+1 points on a line then there must be at most f_k(n) many lines containing at least k points. Is it true that f_k(n)=o(n^2) for k≥ 4?

geometry
01

The problem

Let f_k(n) be minimal such that if n points in ℝ^2 have no k+1 points on a line then there must be at most f_k(n) many lines containing at least k points. Is it true that f_k(n)=o(n^2) for k≥ 4?

Open since1963source estimate
Last checked2026.07.26Catalog verification
02

Reward offers

Offer 01$100Paul Erdős / Combinatorics Foundation
Documented

A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.

03

Sources & reading