{"intvolume":"       128","publisher":"Elsevier","type":"journal_article","publication_status":"published","abstract":[{"lang":"eng","text":"A graph G is said to be Ramsey size-linear if r(G, H) = OG(e(H))\r\nfor every graph H with no isolated vertices. Erdős, Faudree,\r\nRousseau, and Schelp observed that K4 is not Ramsey size-linear,\r\nbut each of its proper subgraphs is, and they asked whether there\r\nexist infinitely many such graphs. In this short note, we answer\r\nthis question in the affirmative"}],"citation":{"ama":"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>","short":"Y. Wigderson, European Journal of Combinatorics 128 (2025).","ista":"Wigderson Y. 2025. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 128, 104175.","ieee":"Y. Wigderson, “Infinitely many minimally non-Ramsey size-linear graphs,” <i>European Journal of Combinatorics</i>, vol. 128. Elsevier, 2025.","chicago":"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>.","mla":"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>.","apa":"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>"},"doi":"10.1016/j.ejc.2025.104175","scopus_import":"1","month":"08","article_processing_charge":"No","volume":128,"language":[{"iso":"eng"}],"year":"2025","quality_controlled":"1","publication":"European Journal of Combinatorics","extern":"1","_id":"22181","date_created":"2026-06-29T10:59:47Z","article_number":"104175","oa_version":"Preprint","oa":1,"external_id":{"arxiv":["2409.05931"]},"arxiv":1,"publication_identifier":{"issn":["0195-6698"]},"OA_type":"green","date_published":"2025-08-01T00:00:00Z","day":"01","OA_place":"repository","article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2409.05931 ","open_access":"1"}],"author":[{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval","last_name":"Wigderson","first_name":"Yuval"}],"title":"Infinitely many minimally non-Ramsey size-linear graphs","date_updated":"2026-07-14T09:13:09Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}