1,078 views
0 votes
0 votes
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 ________.

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

Answer given 51

but why not 100?

1 Answer

Best answer
2 votes
2 votes
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

Related questions

2 votes
2 votes
1 answer
3
srestha asked Jan 6, 2018
1,293 views
Which of these diagrams are lattice and why?
0 votes
0 votes
0 answers
4
Ray Tomlinson asked Nov 30, 2023
216 views
why option 2 is not a distributive lattice ? i solved this and found that there are each vertex has only either one or zero complement i think it is distributive lattic...