關于蘊含K-,r,s,t-可圖序列的一個極值問題.pdf

1、廣西大學碩士學位論文關于蘊含K可圖序列的一個極值問題姓名：馬益聰申請學位級別：碩士專業(yè)：基礎數(shù)學指導教師：尹建華黃國勛20050501一￡里叁蘭塑圭蘭堡望圭堡!!i量!蘭蘭堡壘壘!，!!三墼皇型竺三塵竺竺竺蘭“=============================================————一一——AnExtremalProblemonPotentiallyKr、s、tGraphicSequencesABSTRACTAv

2、ariationofclassical丑lr矗n—typeextremalproblemsisconsideredasfollows：foragivengraphH，determinethesmallestevenintergero(H，n)sackthateveryntermpositivegraphicsequence丌=(dl，d2，，dn)withtermSHill盯(7r)=dld2’’’dn≥盯f日札1hasarealiza

3、tionGcontainingHasasubgraphForH—K％l，ErdSs，JacobsonandLehelconJecturedthat口(／G1，n)=(☆1)(2n—k)2forsufficientlylargenRecentlyLietalprovedthatconjectureistrueInrecentYineta1furtherdeterminedthevalnesof口(珥。，n)Thisthesismainly

4、considerstheproblemofdeternlingthevaluesof口(坼^t，n)，andobtainthefollowingresults：1Determiningthevaluesofo(K1，2，3，n)forn≥6；2Determiningthevaluesof盯(Kl矗。，禮)fors≥4and札≥2【學]8KEYWORDS：graph；degreesepuence；potentiallyK“一graphic