典型文献
On Disjoint Cycles of the Same Length in Tournaments
文献摘要：
A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical technique called the method of paired comparisons and they have also been studied in connection with sociometric relations in small groups.In this paper,we investigate disjoint cycles of the same length in tournaments.In 2010,Lichiardopol conjectured that for given integers l≥3 and k≥1,any tournament with minimum out-degree at least(l-1)k-1 contains k disjoint l-cycles,where an l-cycle is a cycle of order l.Bang-Jensen et al.verified the conjecture for l=3 and Ma et al.proved that it also holds for l≥10.This paper provides a proof of the conjecture for the case of 9≥l≥4.
文献关键词：
中图分类号：
作者姓名：
YUN WANG;JIN YAN;SHUO ZHU
作者机构：
School of Mathematics,Shandong University,Jinan 250100,China
文献出处：
引用格式：
[1]YUN WANG;JIN YAN;SHUO ZHU-.On Disjoint Cycles of the Same Length in Tournaments)[J].应用数学学报（英文版）,2022(02):271-281
A类：
Disjoint,Tournaments,sociometric,Lichiardopol
B类：
On,Cycles,Same,Length,orientation,complete,form,perhaps,most,interesting,class,digraphs,has,great,potential,application,model,statistical,technique,called,method,paired,comparisons,they,have,also,been,studied,connection,relations,small,groups,In,this,paper,we,investigate,disjoint,cycles,same,length,tournaments,conjectured,that,given,integers,any,minimum,out,degree,least,contains,where,order,Bang,Jensen,verified,Ma,proved,holds,This,provides,proof,case
AB值：
0.555686
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
