scientific article; zbMATH DE number 3896977
From MaRDI portal
Publication:3676173
[For the entire collection see Zbl 0559.00001.] If \(G,H\) are graphs, \(\hat r(G,H)\) denotes \(\min|E(F)|\) for \(F\to (G,H)\). Several exact and asymptotic results (in terms of \(n\)) are given for \(\hat r(tK_2,G)\) where \(tK_2\) is the disjoint union of \(t\) edges, \(G\) is a classical graph on \(n\) vertices, i.e. is \(K_n\), \(C_n\), \(P_n\) or is obtained by some simple operations.
Recommendations
- A note on the size Ramsey numbers for matchings versus cycles.
- Connected size Ramsey number for matchings vs. small stars or cycles
- On a Question of Erdös and Faudree on the Size Ramsey Numbers
- scientific article; zbMATH DE number 7104553
- The connected size Ramsey number for matchings versus small disconnected graphs
Cited in
(14)- Size bipartite Ramsey numbers
- Connected size Ramsey number for matchings vs. small stars or cycles
- Star-critical Ramsey numbers of wheels versus odd cycles
- Deleting edges from Ramsey graphs
- On a Question of Erdös and Faudree on the Size Ramsey Numbers
- A note on the size Ramsey numbers for matchings versus cycles.
- The connected size Ramsey number for matchings versus small disconnected graphs
- Two variants of the size Ramsey number
- On star-critical and upper size Ramsey numbers
- Size Gallai-Ramsey number
- Recent developments of star-critical Ramsey numbers
- Size Ramsey numbers of forests versus brooms
- Matching-star size Ramsey numbers under connectivity constraint
- Connected size Ramsey numbers of matchings versus a small path or cycle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676173)