scientific article; zbMATH DE number 3871408
[For the entire collection see Zbl 0543.00003.] Given graph F, G and H, we write \(F\to (G,H)\) if, for every two coloring of the edges of F, there exists either a copy of G with all of its edges colored by the first color or a copy of H with all of its edges colored by the second color. Let p(F) and q(F) denote respectively the vertex and edge numbers of F. The usual Ramsey number r(G,H) is defined as the minimum of p(F) over all F such that \(F\to (G,H).\) The size Ramsey number \(r_ q(G,H)\) is defined as the minimum of q(F) over all F such that \(F\to (G,H)\). In this paper the authors study \(r_ q(G,H)\) where G is a star and H a complete bipartite graph with one class consisting of two vertices.
- Remarks on a paper by H. Bielak on size Ramsey numbers
- On the multicolor size Ramsey number of stars and cliques
- On the restricted size Ramsey number involving a path \(P_3\)
- Some Variants of the Star Height Problem
- A survey of results on the size Ramsey number
- Size ramsey numbers of stars versus 4‐chromatic graphs
- Matching-star size Ramsey numbers under connectivity constraint
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 Q3338286)