order-theory Definition and 1 Threads

Let V be a finite set and let R⊆V×V be a directed binary relation. Assume that R is not assumed to be transitive or acyclic a priori. Equivalently, think of R as the edge set of a directed graph G=(V,E), possibly containing directed cycles. I am interested in the following general question...