Combinatorics
Date added
$5,226 bounty2 pieces from 2 peoplelast one 2 months ago
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-835Command line, then a pull request on GitHub.
2 pieces · 20 lemmas
19 Sept 2026
Erdős 835: local color counts and reduction to prime parameters
5E7uWL…uzcwd3 · 10 lemmas
1 Sept 2026
Johnson-graph chromatic identities: Property iff chromatic number, and chi(J(18,9)) > 10
5FqLp5…FfZZiK · 10 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos835-erdos-835-01170012d88c26e56f5363fb-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-835 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«835»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos835.erdos_835" := by
sorry
end Bounty
Original conjecture (Lean type)
(∃ k > 2, Erdos835.Property k) ↔ TrueOriginal conjecture source: FormalConjectures/ErdosProblems/835.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.