So I have the question:Prove that any directed cycle in the graph of a partial order must only involve one node.So I know that a partial order must be transitive, antisymmetric, and reflective, but from there I am pretty lost. I also know that any path of one or more edges from a node to itself is a directed cycle, but from there I am having trouble connecting everything.I kind of need help as to where to start thinking, and the first step as to how to answer this question.
Prove that any directed cycle in the graph of a partial order must only involve one node
graphs;graph traversal;partial order;order theory