Infinitely many minimally non-Ramsey size-linear graphs
Wigderson Y. 2025. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 128, 104175.
Download (ext.)
Journal Article
| Published
| English
Scopus indexed
Author
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. Erdős, 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
Publishing Year
Date Published
2025-08-01
Journal Title
European Journal of Combinatorics
Publisher
Elsevier
Volume
128
Article Number
104175
ISSN
IST-REx-ID
Cite this
Wigderson Y. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 2025;128. doi:10.1016/j.ejc.2025.104175
Wigderson, Y. (2025). Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104175
Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104175.
Y. Wigderson, “Infinitely many minimally non-Ramsey size-linear graphs,” European Journal of Combinatorics, vol. 128. Elsevier, 2025.
Wigderson Y. 2025. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 128, 104175.
Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” European Journal of Combinatorics, vol. 128, 104175, Elsevier, 2025, doi:10.1016/j.ejc.2025.104175.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
arXiv 
Google Scholar