retagged by
655 views
7 votes
7 votes

The maximum length of cycles in a digraph of partial order on $G$ having $p$ elements is _______:
 

  1.   $p$       
  2.   $p^{-1}$    
  3.   $1$        
  4.   $2^{p}$
retagged by

1 Answer

Best answer
13 votes
13 votes
The partial order is reflexive and antisymmetric, which means that aRb and bRa iff a = b.
This implies that there is only one cycle starting at a and ending at a, which is a self-loop of a to itself.
 For example, if $A = \{a, b, c\}$ then $R = \{(a, a), (b, b), (c, c)\}$. This means a self loop at each of a, b and c .
edited by
Answer:

Related questions

5 votes
5 votes
1 answer
1
0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
3