A graph which embeds all small graphs on any large set of vertices (Q1101446)

The main construction of this paper produces a colouring P: [\(\omega\) \({}_ 1]^ 2\to \omega_ 1\) such that for every \(X\in [\omega_ 1]^{\omega_ 1}\), \(n\in \omega\) and h: [n]\({}^ 2\to \omega_ 1\) there is an injection i:n\(\to X\) such that \(P(i''A)=h(A)\) for every \(A\in [n]^ 2\). Further properties of this colouring and the problem of generalization of higher cardinals are discussed. Finally, as an application a non-separable Banach space with few operators is constructed.