For every graph H with an edge whose deletion lowers its 2-density, G(n, c n^-1/m2(H)) is a.a.s. such that every H-free 2-coloring is destroyed by adding omega(1) random edges; a similar 3-colour statement holds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Ramsey games near the critical threshold
For every graph H with an edge whose deletion lowers its 2-density, G(n, c n^-1/m2(H)) is a.a.s. such that every H-free 2-coloring is destroyed by adding omega(1) random edges; a similar 3-colour statement holds.