combinatorics / Discrete geometry

The Kára–Pór–Wood Big-Line-Big-Clique Conjecture: Four Collinear Points or a Six-Clique

The big-line-big-clique conjecture of Kára, Pór and Wood asserts that for all $k, \ell$ there is an $n$ such that every finite point set of at least $n$ points contains $\ell$ collinear points or $k$ points that pairwise see each other. True for $\ell = 4$, $k = 6$, the first case left open: every finite point set of size at least $10^{11055931}$ has four collinear points or six pairwise visible points.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsAug 19, 2026Significance 28/100Registry: unreviewed

The Kára–Pór–Wood Big-Line-Big-Clique Conjecture: Four Collinear Points or a Six-Clique

Prior state unknownproved

The big-line-big-clique conjecture of Kára, Pór and Wood asserts that for all $k, \ell$ there is an $n$ such that every finite point set of at least $n$ points contains $\ell$ collinear points or $k$ points that pairwise see each other. True for $\ell = 4$, $k = 6$, the first case left open: every finite point set of size at least $10^{11055931}$ has four collinear points or six pairwise visible points.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The big-line-big-clique conjecture of Kára, Pór and Wood asserts that for all $k, \ell$ there is an $n$ such that every finite point set of at least $n$ points contains $\ell$ collinear points or $k$ points that pairwise see each other. True for $\ell = 4$, $k = 6$, the first case left open: every finite point set of size at least $10^{11055931}$ has four collinear points or six pairwise visible points.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.