Back to Problems

div_johnsonBound_le_chromaticNum_johnson

Specification

Johnson's bound for the chromatic number of the Johnson graph.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
lemma div_johnsonBound_le_chromaticNum_johnson :
    ⌈(n.choose k / johnsonBound n 4 k : ℚ≥0)⌉₊ ≤ χ(J(n, k))
ID: ErdosProblems__835__div_johnsonBound_le_chromaticNum_johnson
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.