A lower bound for the chromatic number of graphs with a given maximal degree and girth

For every $g\ge 3$ we prove the existence of a simple graph with maximum degree at most $6$, girth at least $g$ and chromatic number at least $4$.