Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado

DOI10.37236/8849zbMath1439.05085arXiv1907.03254OpenAlexW3104618901MaRDI QIDQ2181995

Menachem Magidor, Shimon Garti, Saharon Shelah

Publication date: 20 May 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.03254

zbMATH Keywords

Erdős-Rado theoremstrong polarized relation

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Partition relations (03E02) Infinite graphs (05C63)

Related Items (3)

An almost strong relation ⋮ Unbalanced polarized relations ⋮ Erdős-Kakutani phenomena for paths

Cites Work

• Unnamed Item
• Unnamed Item
• A diamond example of an ordinal graph with no infinite paths
• Martin's axiom and ordinal graphs: Large independent sets or infinite paths
• Combinatorial set theory: Partition relations for cardinals
• Partition relations for partially ordered sets
• Partitioning pairs of countable ordinals
• Weak versions of Ramsey's theorem
• A partition relation for partially ordered sets
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• A GCH Example of an Ordinal Graph with no Infinite Path
• Set Theory
• A polarized partition relation for cardinals of countable cofinality
• Partition relations for cardinal numbers
• A large cardinal in the constructible universe
• Amenable colorings

This page was built for publication: Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado