Remark: Family 170. Sharp logarithmic exponents for off-diagonal Ramsey numbers

For every fixed integer $s\ge 5$, proves $r(s,t)=t^{s-1}/(\log t{)}^{s-2+o(1)}$ as $t\to \infty$, determining the logarithmic exponent and matching the classical upper bound at that scale. Here $r(s,t)$ is the least number of vertices forcing an $s$-clique or a $t$-vertex independent set.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.