Star-critical Ramsey number of matchings versus a complete graph

عنوان به زبان ديگر

پديدآورندگان

Raeisi Ghaffar g.raeisi@sci.sku.ac.ir Department of Mathematical Sciences, Shahrekord University Shahrekord , Kamranian Azam azamkamranian@stu.sku.ac.ir Department of Mathematical Sciences, Shahrekord University Shahrekord

تعداد صفحه

6

كليدواژه

Ramsey number , Star , critical , Free coloring , Matchings , Complete graph

سال انتشار

1397

عنوان كنفرانس

سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات

زبان مدرك

انگليسي

چكيده فارسي

For given graphs G1, … , Gt, the Ramsey number r(G1, … , Gt) is defined as the smallest positive integer n such that Kn → (G1, … , Gt) and the star-critical Ramsey number r∗(G1, … , Gt) is defined to be min{\delta(F): F ⊆ Kr F → (G1, … , Gt)}. The aim of this paper is to study the star-critical Ramsey number of matchings versus a complete graph. In fact, the exact value of the star-critical Ramsey number r∗(Kn, m1K2, … , m1K2) will be computed for n ≥ t + 1.

چكيده لاتين

For given graphs G1, … , Gt, the Ramsey number r(G1, … , Gt) is defined as the smallest positive integer n such that Kn → (G1, … , Gt) and the star-critical Ramsey number r∗(G1, … , Gt) is defined to be min{\delta(F): F ⊆ Kr F → (G1, … , Gt)}. The aim of this paper is to study the star-critical Ramsey number of matchings versus a complete graph. In fact, the exact value of the star-critical Ramsey number r∗(Kn, m1K2, … , m1K2) will be computed for n ≥ t + 1.

كشور

ايران