The threshold for G(n,p) arrow (mH)_2 is n^{-1/max{m2(H),1}} with m approximately n/(2k-alpha), matching the Rodl-Rucinski threshold for most H.
Morris, Some recent results in Ramsey theory, arXiv preprint
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
math.CO 5years
2026 5verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
f^{(4)}_{5^{-},6}(N) equals (log log N) to the Theta(1) power, with improved lower bounds r_4(6,n) >= 2^{2^{c sqrt(n)}} and r_k(k+2,n).
New iterative proof of Nikiforov's theorem on H-blowups that improves the constant c_H(γ).
Proves existence of r-graphs G with G not arrowing to (K_t1^r ,...,K_tℓ^r) but arrowing to (K_s^r , K_{tℓ-1}^r) where s = R(...) - 1, extending the r=2 case.
citing papers explorer
-
Ramsey properties for tilings in random graphs
The threshold for G(n,p) arrow (mH)_2 is n^{-1/max{m2(H),1}} with m approximately n/(2k-alpha), matching the Rodl-Rucinski threshold for most H.
-
Some results on small ordered and cyclic Ramsey numbers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
-
A Note on Generalized Erd\H{o}s-Rogers Problems
f^{(4)}_{5^{-},6}(N) equals (log log N) to the Theta(1) power, with improved lower bounds r_4(6,n) >= 2^{2^{c sqrt(n)}} and r_k(k+2,n).
-
Finding blowups one vertex at a time
New iterative proof of Nikiforov's theorem on H-blowups that improves the constant c_H(γ).
-
A note on hypergraphs with asymmetric Ramsey properties
Proves existence of r-graphs G with G not arrowing to (K_t1^r ,...,K_tℓ^r) but arrowing to (K_s^r , K_{tℓ-1}^r) where s = R(...) - 1, extending the r=2 case.