{"title":"Infinitely many minimally Ramsey size-linear graphs","authors":"Yuval Wigderson","doi":"arxiv-2409.05931","DOIUrl":null,"url":null,"abstract":"A graph $G$ is said to be Ramsey size-linear if $r(G,H) =O_G (e(H))$ for\nevery graph $H$ with no isolated vertices. Erd\\H{o}s, Faudree, Rousseau, and\nSchelp observed that $K_4$ is not Ramsey size-linear, but each of its proper\nsubgraphs is, and they asked whether there exist infinitely many such graphs.\nIn this short note, we answer this question in the affirmative.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.