Colouring without triangles and partition relation

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

We solved questions of Erdös and Hajnal and deal with related topics. In particular, we show (CH) that in an example of N→[N] 3 2, there need not be a triangle with three colours.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalIsrael Journal of Mathematics
Volume20
Issue number1
DOIs
StatePublished - Jan 1975

Fingerprint

Dive into the research topics of 'Colouring without triangles and partition relation'. Together they form a unique fingerprint.

Cite this