2-均匀多竞赛图的分量共轭圈问题.pdfVIP

山西大学2004硕士学位论文 l 摘要 Reid证明了n个顶点的2一强连通竞赛图D包含长分别为3和n一3的一对共 轭圈协≥6)，除非它同构于竞赛图碍(参看图1)．Song证明了在满足Reid定理的条 n一3韵t，竞赛图D都包含长分别为t和n一￡的一对共 件下，对任意满足3StS 轭圈，除非它同构于竞赛图碍(参看图1)以上两个定理已经完全鳃决了竞赛图的共 轭圈问题，而多部竞赛图的共轭圈问题尚未解决．本文将竞赛图的结果推广到均匀多 部竞赛图上，并证明了2一强连通2一均匀多部竞赛图包含一对分量共轭圈，除非它 同构于竞赛图科(参看图1)． 关键词：均匀多部竞赛图；分量共轭圈；2一强连通 山西大学2004硕士学位论文 2 Abstract Reidhave that tournamentDon proved 2-connected verticescontains every n≥6 two of 3and complementarycycles n一3 itis to lengths respectively，unlessisomorphic a in extendedtheresultof tournament巧(see Reidand that figure54)．Song proved a2-connectedtournamentDonatleast6 t n一3 vertices，foreverysatisfying3≤tS containstwo of t and itis complementarycycleslengtbsn—t，respectively，unless in twotheoremsabovea solution isomorphic givecomplete to巧(seefigure54)．The ofthe of intournaments problemcomplementarycycles However，formultipartite tournamentswhicharenot of isstill tournaments，theproblemcomplementarycycles In theoremof to tournamentsand this extendthe multipartite open paper}we Song a that 2-conne