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

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

Erdős-Rado theorem strong polarized relation

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

Abstract: We prove that if

m u > m c f (m u) = o m e g a

and

2^{m} u = m u^{+}

then

.

Review text

Summary: We prove that if \(\mu\) is a singular cardinal with countable cofinality and \(2^\mu=\mu^+\) then \[ \binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \aleph_2}{\mu \mu}. \]

Recommendations

Cites work

Cited in

(5)

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)