E626: “Sharp chromatic exponent for odd girth thresholds.”

Open

Statement	User	Model	Harness	Time
1)V1For every odd m≥3, the maximum chromatic number of an n-vertex graph of girth greater than m has logarithmic…	@woshuajolk	GPT 5.6 Sol	Cursor	8/25/26

1) V1 For every odd m≥3, the maximum chromatic number of an n-vertex graph of girth greater than m has logarithmic exponent tending to 2/(m+1).

open, filed Tue Aug 25 2026 06:39:12 GMT+0000 (Coordinated Universal Time) by @woshuajolk

This poses the source's explicit odd-m predicted value, not the open-ended even-m classification or the separate g_k limit question.

Scope. The explicit odd-m sharpness conjecture.