The r(4,t) asymptotic conjecture
Statement
For positive integers and , let denote the smallest integer such that every graph on vertices contains either a clique of size or an independent set of size . The asymptotic conjecture. As ,
The conjectured order would improve the currently discussed lower-bound target and concerns the asymptotic growth of the off-diagonal Ramsey number ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.