The Kohayakawa-Prömel-Rödl conjecture asserts that, for every fixed finite simple graph 
, there is a constant 
such that
 |
for every simple graph 
of graph order 
. Here 
is the induced Ramsey
number. Zhong et al. (2026) proved the conjecture by establishing
 |
for 
.
Thus 
suffices. The polynomial dependence on 
requires 
to be fixed. It does not give a polynomial
diagonal bound in the common graph order.
