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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.