Infinitely many minimally non-Ramsey size-linear graphs

TL;DR

This paper proves the existence of infinitely many graphs that are minimally non-Ramsey size-linear, answering a question about their abundance and properties in graph theory.

Contribution

It establishes the existence of infinitely many minimally non-Ramsey size-linear graphs, expanding understanding of their structure and frequency.

Findings

Confirmed infinitely many such graphs exist

Characterized properties of minimally non-Ramsey size-linear graphs

Extended previous observations about specific graphs like K4

Abstract

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