UGC NET CS 2009-June-Paper-2
April 20, 2024
Question 11067 – Set-Theory
April 20, 2024
UGC NET CS 2009-June-Paper-2
April 20, 2024
Question 11067 – Set-Theory
April 20, 2024

GATE 1991

Question 14

If the longest chain in a partial order is of length n then the partial order can be written as a ______ of n antichains.

A
disjoint
Question 14 Explanation: 
Suppose the length of the longest chain in a partial order is n. Then the elements in the poset can be partitioned into a disjoint antichains.
Correct Answer: A
Question 14 Explanation: 
Suppose the length of the longest chain in a partial order is n. Then the elements in the poset can be partitioned into a disjoint antichains.

Leave a Reply

Your email address will not be published. Required fields are marked *