Answers are grounded in this paper and cite their sources.
Mathematical analysis reveals anti-Ramsey numbers for length-four directed cycles in complete biorientations, highlighting exact extremal thresholds for path-free digraphs.
Let Kₙ be the complete biorientation of Kₙ . Given a coloring of the arcs of Kₙ , a subdigraph D of Kₙ will be called rainbow if no two arcs of D receive the same color. For an integer n, let ar(n, C₄) be the minimum integer k such that every coloring of the arcs of Kₙ with k colors produces a rainbow copy of the directed cycle of order 4. In this paper, we show that for n≥ 9 , ar(n, C₄)=τ (n,4)+2 , where τ (n,4) is the Turán number of K₄ , and characterize the extremal colorings for n≥ 12 (also bounds for the small cases are presented). Using these results it is proved that for n≥ 9 , ex(n, P₄) = τ (n,4) where ex(n, P₄) is the maximum size of a simple digraph free of directed paths of order 4 (the Turán number of P₄ ).
No takes yet. Share an insight, caveat, or question.
Juan José Montellano‐Ballesteros (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: