Acyclic Sets and Colorings in Digraphs Under Restrictions on Degrees and Cycle Lengths

ABSTRACT Given a digraph , we denote by the maximum size of an acyclic set of (i.e., a set of vertices which induces a subdigraph with no directed cycles), and by the minimum number of acyclic sets into which can be partitioned. In this paper, we study and from various perspectives, including restrictions on degrees and cycle lengths. A main result is that, if is a random ‐regular digon‐free simple digraph of order , then with high probability. This corresponds to a result of Spencer and Subramanian on the Erdős–Rényi random digraph model [23]. Along the way, we derive some related results and propose some conjectures. An example of this is an analog of the theorem of Bondy which bounds the chromatic number of a graph by the circumference of any strong orientation.