Consider the following coloring process in a simple directed graph G(V, E) with positive indegrees. Initially, a set S of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irr...