On Ramsey Size-Linear Graphs and Related Questions

From MaRDI portal




Abstract: In this paper we prove several results on Ramsey numbers R(H,F) for a fixed graph H and a large graph F, in particular for F=Kn. These results extend earlier work of ErdH{o}s, Faudree, Rousseau and Schelp and of Balister, Schelp and Simonovits on so-called Ramsey size-linear graphs. Among others, we show that if H is a subdivision of K4 with at least 6 vertices, then R(H,F)=O(v(F)+e(F)) for every graph F. We also conjecture that if H is a connected graph with , then R(H,Kn)=O(nk). The case k=2 was proved by ErdH{o}s, Faudree, Rousseau and Schelp. We prove the case k=3.











This page was built for publication: On Ramsey Size-Linear Graphs and Related Questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141859)