On the number of non-isomorphic subgraphs

Let $\mathcal{K}$ be the family of graphs on ω₁ without cliques or independent subsets of sizew ₁. We prove that

1. it is consistent with CH that everyGε $\mathcal{K}$ has 2^ω many pairwise non-isomorphic subgraphs,
2. the following proposition holds in L: (*)there is a Gε $\mathcal{K}$ such that for each partition (A, B) of ω₁ either G?GA] orG?GB],
3. the failure of (*) is consistent with ZFC.