Back to Problems

johnsonGraph_2k_k_chromaticNumber_known_cases

Specification

It is known that for $3 \leq k \leq 8$, the chromatic number of $J(2k, k)$ is greater than $k+1$, see [Johnson graphs](https://aeb.win.tue.nl/graphs/Johnson.html).

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem johnsonGraph_2k_k_chromaticNumber_known_cases (k : ℕ) (hk : 3 ≤ k) (hk' : k ≤ 8) :
    J(2 * k, k).chromaticNumber > k + 1
ID: ErdosProblems__835__johnsonGraph_2k_k_chromaticNumber_known_cases
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.