Back to Problems

F_three

Specification

`F n` is the smallest number of vertices of a triangle-free graph with chromatic number `n` and `f = 3`.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem F_three : F 3 = 7
ID: Paper__DegreeSequencesTriangleFree__F_three
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.