# Chain

174 views
Consider F be a family of all subsets of set {1, 2, 3, ..... 100} that contain atleast 50 numbers, partially ordered with respect to containment. Then maximum size of chains in the Poset (F, ⊆) that cover F is ________.

-------------------------------------------------------------------------------------------------------------------------------

but why not 100?
0
yes it should be 51

1 vote

An antichain  in a partially ordered set is a set of elements no two of which are comparable to each other, and a chain is a set of elements every two of which are comparable.

A maximum or longest chain is one which is of the greatest size possible. The size of the longest chain is known as a poset’s height.The following gives an example of such a chain

{1, 2, . . . , 50} ⊂ {1, 2, . . . , 51} ⊂ · · · ⊂ {1, 2, . . . , 100}

which is the maximum size of chain i.e. 51.Hence, the answer is 51.

selected by
0
comparable mean?
0
x and y are comparable if x ≤ y and/or y ≤ x hold
0
ok 50 to 100- total 51 subsets

## Related questions

1
1.5k views
Consider the poset $( \{3,5,9,15,24,45 \}, \mid).$ Which of the following is correct for the given poset ? There exist a greatest element and a least element There exist a greatest element but not a least element There exist a least element but not a greatest element There does not exist a greatest element and a least element
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$