Abstract
For fixed graphs F 1,... ,F r, we prove an upper bound on the threshold function for the property that G(n, p) → (F 1,... ,F r). This establishes the 1-statement of a conjecture of Kohayakawa and Kreuter.
| Original language | English |
|---|---|
| Pages (from-to) | 943-955 |
| Number of pages | 13 |
| Journal | Combinatorics Probability and Computing |
| Volume | 29 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 2020 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics