1 research outputs found
On Ramsey numbers of complete graphs with dropped stars
Let be the smallest integer such that for any -coloring (say,
red and blue) of the edges of , , there is either a red
copy of or a blue copy of . Let be the complete graph on
vertices from which the edges of are dropped. In this note we
present exact values for and new upper bounds
for in numerous cases. We also present some results for
the Ramsey number of Wheels versus .Comment: 9 pages ; 1 table in Discrete Applied Mathematics, Elsevier, 201