Preprint finds exact one-third threshold for directed cycles through every vertex
For finite oriented graphs, a rounded-up one-third minimum semidegree guarantees a directed cycle of length 3q through each vertex once q ≥ 2 and the graph meets an explicit size cutoff.