The Cacceta-Häggkvist conjecture.

An oriented graph is an orientation of a simple graph, thus it has no circuit of length two. The outdegree of a vertex x is the number of oriented edges xy .

This conjecture is sharp, consider for this the integers 1,..,3k+1, and add all oriented edges xy such that y-x is in 1,..,k mod 3k+1.