Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
Abstract
We characterize all orientations of cycles C for which for every fixed > 0 there exists a constant c ≥ 1 such that every digraph D without loops or parallel arcs with (D) ≥ c and minimum out-degree at least |V(D)| contains C as a subdigraph. This generalizes a result of Thomassen.
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.