combinatorics / Discrepancy Theory

Erdős Problem #176

a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJun 21, 2026Significance 11/100Registry: lean verified

Erdős Problem #176

Prior state unknown→proved

a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open

a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open

Recorded attempts

Evidence graph

Connected research record