Please reload the page if 'Math Error' appears instead of the problems.
If you have a digraph of a finite relation R and there are no cycles in the digraph, then at least one vertex If you have a digraph of a finite relation R and there are no cycles in the digraph, then at least one vertex has out-degree 0.
What would be an appropriate approach to prove the statement? As a class try to piece has out-degree 0.
What would be an appropriate approach to prove the statement?
As a class try to piece together a complete proof. (You may want to revisit Section 4.3 Paths in Relations and Digraphs.) together a complete proof. (You may want to revisit Section 4.3 Paths in Relations and Digraphs)