شماره مدرك :
8394
شماره راهنما :
7775
پديد آورنده :
پارسه، حسن
عنوان :

عدد رمزي ابرگراف هاي كامل k- يكنواخت

مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
سال دفاع :
1392
صفحه شمار :
هشت،62ص.: مصور
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
غلامرضا اميدي
استاد مشاور :
رضا رضائيان
توصيفگر ها :
عدد رمزي
تاريخ نمايه سازي :
15/10/92
استاد داور :
بهناز عمومي، غفار رئيسي
دانشكده :
رياضي
كد ايرانداك :
ID7775
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Abstract The Ramsey theory is one of the most important branches of combinatorics and contains several open problems It refers to the study of partitions of large structures Typical results state that a certain substructure must occur in some classes of partitions Several papers in this field have been published in the most trustworthy journals Frank Plumpton Ramsey in submitted a paper that was posthumously published in The paper contained infinite and finite versions of what has consists of a vertex set since appeared under the name of the Ramsey theorem A hypergraph and an edge set which is a collection of subsets of A hypergraph is uniform if each edge has contains a monochromatic copy of H For we denote by exactly vertices For a uniform hypergraph the Ramsey number r H l is and also in the case we use the minimum such that every coloring of the tuples of an element set One of the initial achived bounds for hypergraph Ramsey numbers is a showed that where theorem due to Erd s and Rado This theorem was published in They In Sudakov Conlon and Fox presented two ways to improve an approuch due to Erd s and Rado to give some upper bounds for the Ramsey number of complete uniform hypergraphs The first way was based on builder bound for and painter game By using the strategy in this game they improved an upper Erd s Hajnal and Rado showed that there are positive constants c and c such that They also conjectured that for some constant and Erd s offered a $ reward for a proof Similarly for there is a difference of one exponential between the known upper and lower bounds for i e where the tower function is defined by and The study of uniform hypergraphs is particularly important for our understanding of hypergraph Ramsey numbers This is because of an ingenious construction called PDF created with pdfFactory trial version www pdffactory com
استاد راهنما :
غلامرضا اميدي
استاد مشاور :
رضا رضائيان
استاد داور :
بهناز عمومي، غفار رئيسي
لينک به اين مدرک :

بازگشت