- #1
Andrei1
- 36
- 0
My answers:Let \(\displaystyle K_n\) be the \(\displaystyle n\)-clique for some \(\displaystyle n\in\mathbb{N}\). Then any graph having at most \(\displaystyle n\) vertices is a subgraph of \(\displaystyle K_n\).
(a) How many substructures does \(\displaystyle K_n\) have?
(b) How many substructures does \(\displaystyle K_n\) have up to isomorphism?
(c) How many elementary substructures does \(\displaystyle K_n\) have?
(a) \(\displaystyle 2^n\)
(b) \(\displaystyle n\)
(c) \(\displaystyle 2^n\)
Are they correct?