Partition Relations Connected with the Chromatic Number of Graphs

DOI10.1112/jlms/s1-34.1.63zbMath0084.19701OpenAlexW2049180082MaRDI QIDQ3252413

Paul Erdős, Richard Rado

Publication date: 1959

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-34.1.63

zbMATH Keywords

topology

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Other combinatorial set theory (03E05)

Related Items (5)

On Taylor's problem ⋮ A note on chromatic number and connectivity of infinite graphs ⋮ Trees, ladders and graphs ⋮ Obligatory subsystems of triple systems ⋮ An uncountably chromatic triple system

This page was built for publication: Partition Relations Connected with the Chromatic Number of Graphs