Oriented trees in digraphs without oriented 4-cycles
Abstract
We prove that if $D$ is a digraph of maximum outdegree and indegree at least $k$, and minimum semidegree at least $k/2$ that contains no oriented $4$-cycles, then $D$ contains each oriented tree $T$ with~$k$ arcs. This can be slightly improved if $T$ is either antidirected or an arborescence.
Fields of Study & Subjects
Advanced Graph Theory Research
graph theory and CDMA systems
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Discrete Mathematics
- Volume
- 349
- Issue
- 12
- Pages
- 115288–115288
- Publication date
- 22 June 2026
- Language
- EN