Establishes that the 2-color Ramsey number for sufficiently many vertex-disjoint copies of H remains asymptotically the same in the random graph G(n,p) for appropriate p.
Erd˝ os, Some unsolved problems in graph theory and combinatorial analysis, inCombinatorial Mathematics and Its Applications (Proc
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
-
A random version of the Burr-Erd\H{o}s-Spencer theorem
Establishes that the 2-color Ramsey number for sufficiently many vertex-disjoint copies of H remains asymptotically the same in the random graph G(n,p) for appropriate p.