Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is
@Deepak Poonia Sir if the question had asked about number of edges including the implicit edges then the answer would have been same??
abir_banerjee
what do you mean by “implicit edges”?
Answer: B Hasse Diagram is$:$
We don't represent transitive edges in Hasse diagram.
@ankit3009 I think previously the diagram was different from what it is now and notice Lakshman sir edited it after Sachin sir's comment. So most probably lakshman sir rectified the error.
24
/
12
6
/ \
2 3
Now u can count number of edges will be 4.
Elements can be related like below as well.
if any relation can be inferred from transitive property then there is not need to give a edge.
Here 6 divides 12 and 12 divides 24 so by transitivity 6 can also divide 24. So edge from 12 to 24 is required. edge from 6 to 24 is useless.
.
64.3k questions
77.9k answers
244k comments
80.0k users