Determines the threshold number of random edges to add to a dense graph to guarantee the asymmetric vertex-Ramsey property for any r and any graph tuple with high probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs
Determines the threshold number of random edges to add to a dense graph to guarantee the asymmetric vertex-Ramsey property for any r and any graph tuple with high probability.