On the number of non-isomorphic subgraphs (Q1327515)

It is consistent with CH that every graph on \(\omega_ 1\) with no uncountable clique or independent set has \(2^{\aleph_ 1}\) non- isomorphic subgraphs. It is also consistent that every graph \(G\) as above has a vertex decomposition \(\omega_ 1= A\cup B\) such that neither \(G\upharpoonright A\) nor \(G\upharpoonright B\) is isomorphic to \(G\). \(\text{V}=\text{L}\) implies the negation of this statement.