In this work, we construct the first examples of non-bipartite k-common graphs for k at least 3, which resolves a problem of Jagger, Stovícek and Thomason from 1996. A graph H is said to be "k-common" if the number of ...