EEMCS EPrints Service
Li, Binlong and Zhang, Yanbo and Broersma, H.J. (2017) An exact formula for all star-kipas Ramsey numbers. Graphs and combinatorics, 33 (1). pp. 141-148. ISSN 0911-0119 *** ISI Impact 0,480 ***
Full text available as:
Official URL: http://dx.doi.org/10.1007/s00373-016-1746-3
Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or the complement of G contains a G2. A complete bipartite graph K1,n is called a star. The kipas of order n+1 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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item