JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Shelah, Saharon

Shelah, Saharon

1988-05

Citation:Shelah, S. (1988/05)."A graph which embeds all small graphs on any large set of vertices." Annals of Pure and Applied Logic 38(2): 171-183. <http://hdl.handle.net/2027.42/27309>

Abstract: For certain cardinals [lambda] and [kappa] a colouring P:[[lambda]]2-->[lambda] is constructed such that if X [epsilon][[lambda]][lambda] and Q:[[kappa]]2-->[lambda], then there is a one-to-one function i:[kappa]-->X such that P(i"A)=Q(A) for every A[epsilon][[kappa]]2. Additional results are obtained.