An infinite color analogue of Rado's theorem

DOI10.1016/j.jcta.2007.02.005zbMath1127.05102OpenAlexW2018032828MaRDI QIDQ2459498

Jacob Fox

Publication date: 7 November 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.02.005

zbMATH Keywords

partition calculusRado's theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10) Partition relations (03E02)

Related Items (3)

DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS ⋮ Chromatic numbers of algebraic hypergraphs ⋮ The first omega alephs: from simplices to trees of trees to higher walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial set theory: Partition relations for cardinals
• Partitions of vector spaces
• Studien zur Kombinatorik
• A model of set-theory in which every set of reals is Lebesgue measurable
• A partition calculus in set theory
• Avoidable algebraic subsets of Euclidean space
• On minimal colorings without monochromatic solutions to a linear equation
• Note on Combinatorial Analysis
• A system of axiomatic set theory. Part III. Infinity and enumerability. Analysis
• On non-denumerable graphs
• The axiom of choice

This page was built for publication: An infinite color analogue of Rado's theorem