Answers are grounded in this paper and cite their sources.
We show that a directed graph of order n will contain n ‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n ‐1/6 ) n and n is sufficiently large.
No takes yet. Share an insight, caveat, or question.
Häggkvist et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: