จำนวนแรมเซย์ไซส์และจำนวนแรมเซย์ไซส์เชื่อมโยงสำหรับการจับคู่และกราฟไม่เชื่อมโยงขนาดเล็กสองกราฟ

Abstract

In 1978, Erdos, Faudree, Rousseau and Schelp introduced the concept of the size Ramsey number of a graph. In this research work, we extend the concept of the size Ramsey number of a graph to the size Ramsey number and the connected size Ramsey number for matchings and two small disconnected graphs. We obtain the exact values of the size Ramsey numbers and the connected size Ramsey numbers for matchings and some of two small disconnected graphs, respectively.