7275

6781

كارشناسي ارشد

رياضي كاربردي

اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي

1391

هشت، 68ص.: مصور، جدول، نمودار

ص.ع. به فارسي و انگليسي

غلامرضا اميدي

بهناز عمومي

21/8/91

سعيد اكبري، ابراهيم قرباني

1396/09/21

كتابنامه

علوم رياضي

رياضي

ID6781

به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي

Cycle complete Graph Ramsey Numbers Mahboube lot m lot khorzuqhi@math iut ac ir 25 August 2012 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Gholam Reza Omidi romidi@cc iut ac ir Advisor Dr Behnaz Omoomi romidi@cc iut ac ir 2010 MSC 05C15 53C42 Keywords Ramsey number Cycle complete graph independence number Abstract For two given graphs G1 and G2 the Ramsey number R G1 G2 is the smallest integer nsuch that for any graph G of order n either G contaions G1 or the complement of G contaionsG2 In this thesis we adopt the standard notations Cm and Kn for the cycle and completegraph on m and n verticese respectively an independent set of vertices of a graph G isasubset of V G in which no two vertices are adjacent The independence number G ofa graph G is the cardinality of its largest independent set Give a graph H without isolatedvertices the Ramsey number R H Kn is the smallest integer N such that of order N eithercontains H as a subgraph or satiss es G n Let Cm be a cycle of length m and Kn bea complete graph of order n The cycle complete graph Ramsey number R Cm Kn is thesmallest integer N such that for every graph G of order N G contain Cm or G n Thegraph n 1 Km 1 shows that R Cm Kn m 1 n 1 1 Known asymptotic upperbounds on cycle complete Ramsey numbers for x cycle are shown in 1 through 5 below where c s are some positive constants i

غلامرضا اميدي

بهناز عمومي

سعيد اكبري، ابراهيم قرباني