← All problems

Payne–Wood general-position conjecture

There exists an absolute constant c>0c>0 such that, for every positive integer nn and every set P⊂R2P\subset\mathbb{R}^2 of nn points for which every line contains at most n\sqrt{n} points of PP, there is a subset S⊆PS\subseteq P with ∣S∣≥cn|S|\ge c\sqrt{n} such that every line contains at most two points of SS.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An October 2026 preprint claims to prove the Payne–Wood conjecture, but the claim has not been independently checked.

Payne and Wood's conjecture predicts an optimal square-root-size general-position subset in the critical planar case. Their 2013 paper explicitly left this case open.

Known results

  • Payne and Wood (2013): established bounds of order Ω ⁣(n/ln⁡ℓ)\Omega\!\left(\sqrt{n/\ln \ell}\right) when ℓ=O(n)\ell=O(\sqrt n), short of the conjectured Ω(n)\Omega(\sqrt n) result.
  • Payne and Wood (2013): proved stronger bounds when ℓ=O ⁣(n(1−ϵ)/2)\ell=O\!\left(n^{(1-\epsilon)/2}\right).
  • The n×n\sqrt n\times\sqrt n grid supplies the motivating extremal construction.
  • A 2025 selection result restated the same logarithmic-order bound, without resolving the conjecture.

October 2026 claimed proof

Thang Pham, Le Quang-Ham, and Boqing Xue claim that a linear-hypergraph selection theorem gives the conjectured subset size under the optimal quadratic triple-count condition. This is an unrefereed preprint claim, with no independent mathematical corroboration retrieved.

Current status (as of October 2026): The conjecture has a claimed proof in an unrefereed preprint, but its correctness remains unverified.

Sources

Solutions 0

No solutions have been posted yet.