Infinitely many minimally non-Ramsey size-linear graphs
Abstract
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. Erdos, 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.