科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let and be two given graphs. The Ramsey number is the least integer r such that for every graph G on r vertices, either G contains a or contains a . A complete bipartite graph is called a star. The kipas is the graph obtained from a path of order n by adding a new vertex and joining it to all the vertices of the path. Alternatively, a kipas is a wheel with one edge on the rim deleted. Whereas for star-wheel Ramsey numbers not all exact values are known to date, in contrast we determine all exact values of star-kipas Ramsey numbers.
