Payne–Wood general-position conjecture
There exists an absolute constant such that, for every positive integer and every set of points for which every line contains at most points of , there is a subset with such that every line contains at most two points of .
References
- General-position sets and linear hypergraphs — arXiv — Thang Pham, Le Quang-Ham, Boqing Xue
Source: arXiv
Progress summary
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 when , short of the conjectured result.
- Payne and Wood (2013): proved stronger bounds when .
- The 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.
Solutions 0
No solutions have been posted yet.