Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs

Abstract

Let $\overrightarrow{C}$ be any orientation of the cycle $C_{\ell}$ which is not directed. We prove that, for every integer $\ell\ge3$ and every $μ>0$, there is a real $γ$ such that every sufficiently large oriented graph $D$ with $\ell\mid |D|$, minimum semidegree at least $(1/4+μ)|D|$ and independence number at most $γ|D|$ has a $\overrightarrow{C}$-factor. The constant $1/4$ is asymptotically tight. This proof establishes Ramsey-Turán type lattice absorption lemmas and an almost covering theorem via the oriented tree embedding lemma under chromatic number constraints.