ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers ss and tt, let r(s,t)r(s,t) denote the smallest integer nn such that every graph on nn vertices contains either a clique of size ss or an independent set of size tt. The r(4,t)r(4,t) asymptotic conjecture. As t→∞t\to\infty,

r(4,t)=Θ(t3log⁡2t).r(4,t)=\Theta\left(\frac{t^3}{\log^2 t}\right).

The conjectured order would improve the currently discussed lower-bound target and concerns the asymptotic growth of the off-diagonal Ramsey number r(4,t)r(4,t); the source presents it as an open problem and notes that the proposed independent-set counting estimate would suffice to establish the lower bound.

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.