On Erdős-Rado numbers

DOI10.1007/BF01294461MaRDI QIDQ1842571zbMATH OpenOpenAlexFDO

Authors Hanno Lefmann, Vojtěch Rödl

Publication date 8 June 1995

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01294461

zbMATH Keywords

Erdős-Rado number rainbow colorings Ramsey theorem totally multicolored sets

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Review text

The Erdős-Rado number \(\text{ER}(k, l)\) is the smallest \(n\) such that if the \(k\)-subsets of \(\{1,\dots, n\}\) are colored with an arbitrary number of colors, then there is an \(l\)-subset of \(\{1,\dots, n\}\) whose \(k\)-subsets are colored canonically. The existence of such a number is guaranteed by the canonical Ramsey theorem. The authors prove new bounds for the Erdős-Rado numbers, the most important is \(2^{c_ 1 l^ 2}\leq \text{ER}(2, l)\leq 2^{c_ 2 l^ 2\log l}\).

Recommendations

Cites work

Cited in

(23)

This page was built for publication: On Erdős-Rado numbers

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