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

DOI10.1016/0168-0072(88)90052-8zbMath0643.03037OpenAlexW2051184788MaRDI QIDQ1101446

Saharon Shelah

Publication date: 1988

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/27309

zbMATH Keywords

colouringhigher cardinalsnon-separable Banach space

Mathematics Subject Classification ID

Classical Banach spaces in the general theory (46B25) Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items

Universal functions, Partitioning pairs of countable ordinals, A Banach Space on which there are Few Operators, Strong negative partition above the continuum, Equilateral and separated sets in some Hilbert generated Banach spaces, Strong negative partition relations below the continuum, Colouring and non-productivity of \(\aleph_ 2\)-c.c

Cites Work

• Unnamed Item
• Was Sierpinski right? I
• Extraspecial p-groups
• Embedding theorems for graphs establishing negative partition relations