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

DOI10.37236/8849MaRDI QIDQ2181995zbMATH OpenOpenAlexFDO

Authors Shimon Garti, Menachem Magidor, S. Shelah

Publication date 20 May 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

strong polarized relationErdős-Rado theorem

Mathematics Subject Classification ID

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

Abstract: We prove that if $mu>mcf(mu)=omega$ and $2^{m}u=m{u}^{+}$ then $$.

Recommendations

• scientific article; zbMATH DE number 3902684
• Erdős-Hajnal-type results for monotone paths
• Upper density of monochromatic infinite paths
• Density of monochromatic infinite paths
• Monochromatic infinite paths
• Monochromatic paths for the integers
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• scientific article; zbMATH DE number 398964
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Partitioning infinite hypergraphs into few monochromatic Berge-paths

Cites work

• scientific article; zbMATH DE number 1139531 (Why is no real title available?)
• scientific article; zbMATH DE number 3341999 (Why is no real title available?)
• A GCH Example of an Ordinal Graph with no Infinite Path
• A diamond example of an ordinal graph with no infinite paths
• A large cardinal in the constructible universe
• A partition relation for partially ordered sets
• A polarized partition relation for cardinals of countable cofinality
• Amenable colorings
• Combinatorial set theory: Partition relations for cardinals
• Martin's axiom and ordinal graphs: Large independent sets or infinite paths
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Partition relations for cardinal numbers
• Partition relations for partially ordered sets
• Partitioning pairs of countable ordinals
• Set Theory
• Weak versions of Ramsey's theorem

Cited in

(5)

• scientific article; zbMATH DE number 3902684 (Why is no real title available?)
• Erdős-Kakutani phenomena for paths
• An almost strong relation
• Unbalanced polarized relations
• Monochromatic infinite paths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181995)