Colouring without triangles and partition relation

DOI10.1007/BF02756751MaRDI QIDQ1219299zbMATH OpenFDO

Authors S. Shelah

Publication date 1975

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

Full work available at URL https://doi.org/10.1007/BF02756751

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A Two-Cardinal Theorem
• scientific article; zbMATH DE number 3289430 (Why is no real title available?)
• scientific article; zbMATH DE number 3361883 (Why is no real title available?)
• Partition relations for cardinal numbers
• Proof of a conjecture of B. Ruziewicz
• The fine structure of the constructible hierarchy

Cited in

(6)

• Embedding theorems for graphs establishing negative partition relations
• Cardinal characteristics of the continuum and partitions
• Embedding Graphs into Colored Graphs
• A Two-Cardinal Theorem and a Combinatorial Theorem
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• The Erdős-Hajnal problem list

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1219299)