We calculate some size Ramsey numbers involving stars. For example we prove that for t ~ k w2 ~md n sufficiently large the size Ramsey number r,, (K,,k All graphs in this paper are finite, simple and undirected. Let F, C and H be graphs. The number of vertices and edges of a graph F will be denoted
The size Ramsey number
✍ Scribed by P. Erdős; R. J. Faudree; C. C. Rousseau; R. H. Schelp
- Publisher
- Springer Netherlands
- Year
- 1978
- Tongue
- English
- Weight
- 899 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A table of the size Ramsey number or the restricted size Rarnsey number for all pairs of graphs with at most four vertices and no isolated vertices is given. Let F, G, and H be finite, simple, and undirected graphs. The number of vertices and edges of a graph F are denoted byp(F) and q(F), respecti
Erd6s. P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Mathematics 113 (1993) 259-262. In this note we prove that the (diagonal) size Ramsey number of K,,.,, is bounded below by $2'2".
## Abstract We investigate the asymptotics of the size Ramsey number __î__(__K__~1,__n__~__F__), where __K__~1,__n__~ is the __n__‐star and __F__ is a fixed graph. The author 11 has recently proved that __r̂__(__K__~1,n~,__F__)=(1+__o__(1))__n__^2^ for any __F__ with chromatic number χ(__F__)=3. He