DM - Lattice & Group -Q20

0 votes
Let (S,^) be a poset where S is a base set and ^ is a relation defined on S. We can think of the hasse diagram as a undirected graph. Then the maximum number of components possible for this poset is __?
asked Jun 27 in Discrete Maths by gbeditor (44,560 points)
reshown 4 days ago by gbeditor

Please log in or register to answer this question.