Some Ramsey-type theorems

DOI10.1016/0012-365X(91)90135-OzbMath0759.05095OpenAlexW2029516884WikidataQ105719864 ScholiaQ105719864MaRDI QIDQ1174169

Fred Galvin, Paul Erdős

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90135-o

zbMATH Keywords

partitioncoloringhomogeneous setRamsey-type theorems

Mathematics Subject Classification ID

Ramsey theory (05D10)

Related Items (5)

Monochromatic infinite paths ⋮ 2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Density of monochromatic infinite paths ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ A packed Ramsey’s theorem and computability theory

Cites Work

• Combinatorial set theory: Partition relations for cardinals
• Finite sums from sequences within cells of a partition of N
• Monochromatic infinite paths
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Some remarks on the theory of graphs

This page was built for publication: Some Ramsey-type theorems