Colouring without triangles and partition relation

DOI10.1007/BF02756751zbMath0311.05112MaRDI QIDQ1219299

Saharon Shelah

Publication date: 1975

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Embedding theorems for graphs establishing negative partition relations ⋮ Cardinal characteristics of the continuum and partitions ⋮ Embedding Graphs into Colored Graphs ⋮ NOTES ON SOME ERDŐS–HAJNAL PROBLEMS ⋮ A Two-Cardinal Theorem and a Combinatorial Theorem

Cites Work

• Proof of a conjecture of B. Ruziewicz
• A Two-Cardinal Theorem
• Partition relations for cardinal numbers
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item

This page was built for publication: Colouring without triangles and partition relation