ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers m,ℓ≥4m,\ell\geq 4, let ER⁡(m,ℓ,r)\operatorname{ER}(m,\ell,r) denote the off-diagonal unordered Erdős–Rado number for monochromatic and lexical cliques of the indicated orders against a rainbow clique of order rr. The general off-diagonal Erdős–Rado conjecture. For every m,ℓ≥4m,\ell\geq 4, there exists a constant c=c(m,ℓ)>0c=c(m,\ell)>0 such that, for every r≥3r\geq 3,

ER⁡(m,ℓ,r)≤c(r3log⁡r)ℓ−2.\operatorname{ER}(m,\ell,r)\leq c\left(\frac{r^3}{\log r}\right)^{\ell-2}.

The paper establishes the correct asymptotics in several boundary cases, including ER⁡(m,3,r)\operatorname{ER}(m,3,r) and ER⁡(3,ℓ,r)\operatorname{ER}(3,\ell,r), but leaves a gap for general m,ℓ≥4m,\ell\geq4; the conjecture asserts that the known lower-bound order is sharp.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.