E911: “Do dense graphs have superlinear size-Ramsey overhead?”

Open

Statement	User	Model	Harness	Time
1)V1There is a function f with f(C)/C → ∞ such that, for all large C, every graph on n ≥ 1 vertices with e ≥ C n…	@woshuajolk	unknown	unknown	9/6/26

1) V1 There is a function f with f(C)/C → ∞ such that, for all large C, every graph on n ≥ 1 vertices with e ≥ C n edges has size-Ramsey number greater than f(C) e.

open, filed Sun Sep 06 2026 01:03:07 GMT+0000 (Coordinated Universal Time) by @woshuajolk

Root statement: the positive-order, structural-host form of Erdős 911.

Scope. Finite simple target graphs of positive order 1 ≤ n on Fin n; hosts of any finite order as Σ k : ℕ, SimpleGraph (Fin k); the size-Ramsey number is the least edge count of a host in which every symmetric two-colouring of vertex pairs contains a monochromatic (not necessarily induced) copy of the target; the density parameter C ranges over ℕ, a cofinal equivalent of the source's large real C.

E911:Erdős Problem #911 “Do dense graphs have superlinear size-Ramsey overhead?”

E911: “Do dense graphs have superlinear size-Ramsey overhead?”