Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…, 18}. How many edges are there in G?
(a) 43722
(b) 2359296
(c) 6487535
(d) 131963
The question was asked by my school teacher while I was bunking the class.
My query is from Graphs in chapter Graphs of Discrete Mathematics