English

Infinitely many minimally non-Ramsey size-linear graphs

Combinatorics 2025-05-06 v2

Abstract

A graph GG is said to be Ramsey size-linear if r(G,H)=OG(e(H))r(G,H) =O_G (e(H)) for every graph HH with no isolated vertices. Erd\H{o}s, Faudree, Rousseau, and Schelp observed that K4K_4 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.

Keywords

Cite

@article{arxiv.2409.05931,
  title  = {Infinitely many minimally non-Ramsey size-linear graphs},
  author = {Yuval Wigderson},
  journal= {arXiv preprint arXiv:2409.05931},
  year   = {2025}
}

Comments

2 pages

R2 v1 2026-06-28T18:39:02.167Z