Generalized ramsey theory VIII. The size ramsey number of small graphs
Generalized ramsey theory VIII. The size ramsey number of small graphs
复制标题
广义拉姆齐理论VIII。
DOI：
--
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
Zevi Miller
中科院分区：
文献类型：
--
作者：
F. Harary;Zevi Miller
没有分离物的图F的拉姆齐数r(F)已经得到了很多研究。我们现在研究它的大小拉姆齐数ζ(F)定义为最小q，使得存在一个有q条边的图G，其中E(G)的每2色都有一个单色F。图的大小拉姆齐数也被Chvatal， Erdős, Faudree， Rousseau和Schelp研究过。我们得到星星，条纹和几个小图形的ζ(F)的精确值。最后，我们列出了一系列尚未解决的问题。
The ramsey number r(F) of a graph F with no isolates has been much studied. We now investigate its size Ramsey number ζ(F) defined as the minimum q such that there exists a graph G with q edges for which every 2-coloring of E(G) has a monochromatic F. The size ramsey number of a graph has also been studied by Chvatal, Erdős, Faudree, Rousseau and Schelp. We obtain the exact values of ζ(F) for stars, stripes and several small graphs. We conclude with a list of unsolved problems.