article published yes Yuval Wigderson author 2d0023a0-1567-11f0-833d-d5c1e476d4b5 A graph G is said to be Ramsey size-linear if r(G, H) = OG(e(H)) for every graph H with no isolated vertices. Erdős, Faudree, Rousseau, and Schelp observed that K4 is not Ramsey size-linear, but each of its proper subgraphs is, and they asked whether there exist infinitely many such graphs. In this short note, we answer this question in the affirmative Elsevier2025 eng 0195-6698 2409.0593110.1016/j.ejc.2025.104175 128 yes Wigderson Y. 2025. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 128, 104175. Y. Wigderson, “Infinitely many minimally non-Ramsey size-linear graphs,” <i>European Journal of Combinatorics</i>, vol. 128. Elsevier, 2025. Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” <i>European Journal of Combinatorics</i>. Elsevier, 2025. <a href="https://doi.org/10.1016/j.ejc.2025.104175">https://doi.org/10.1016/j.ejc.2025.104175</a>. Wigderson Y. Infinitely many minimally non-Ramsey size-linear graphs. <i>European Journal of Combinatorics</i>. 2025;128. doi:<a href="https://doi.org/10.1016/j.ejc.2025.104175">10.1016/j.ejc.2025.104175</a> Y. Wigderson, European Journal of Combinatorics 128 (2025). Wigderson, Y. (2025). Infinitely many minimally non-Ramsey size-linear graphs. <i>European Journal of Combinatorics</i>. Elsevier. <a href="https://doi.org/10.1016/j.ejc.2025.104175">https://doi.org/10.1016/j.ejc.2025.104175</a> Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” <i>European Journal of Combinatorics</i>, vol. 128, 104175, Elsevier, 2025, doi:<a href="https://doi.org/10.1016/j.ejc.2025.104175">10.1016/j.ejc.2025.104175</a>. 221812026-06-29T10:59:47Z2026-07-14T09:13:09Z