For fixed graphs $F_1,\dotsc,F_r$, we prove an upper bound on the threshold function for the property that $G(n,p) \to (F_1,\dotsc,F_r)$. This establishes the $1$-statement of a conjecture of Kohayakawa and Kreuter.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。