This research shows that oriented graphs with degree conditions contain anti-directed cycles, indicating new findings in digraphs.
Let be the anti‐directed cycle on vertices (an orientation in which consecutive edges alternate direction). In 1980, Grant initiated the study of anti‐directed cycles in digraphs. We show that for any , there exists such that any ‐vertex oriented graph with and contains a ‐factor. In particular, the degree condition is asymptotically sharp.
No takes yet. Share an insight, caveat, or question.
Ming Chen (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: