If the longest chain in a partial order is of length l, then the partial order can be written as            disjoint antichains.

Related MCQs

• A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total orders on the set S which contain the partial order ≤ is              
• Let X be a family of sets and R be a relation in X, defined by ‘A is disjoint from B’. Then, R is
• Two sets are called disjoint if there _____________ is the empty set.
• Which of the following two sets are disjoint?
• The inclusion of              sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment.
• If a node v is reachable from node u then the path of minimum length u to v is called _____.
• If group G has 65 elements and it has two subgroups namely K and L with order 14 and 30. What can be order of K intersection L?
• Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove                    
• If (M, *) is a cyclic group of order 73, then number of generator of G is equal to              
• If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set