A short proof of the existence of highly chromatic hypergraphs without short cycles

Abstract Using the operation of amalgamation we prove that for every k, n, p there exists a k-graph G (i.e., a k-uniform hypergraph) without cycles of length ⩽p such that the chromatic number of G is at least n.