A note on hypertournaments  

作　　者：Linqiang Pan Guofei Zhou Kemin Zhang 

机构地区：[1]Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China

出　　处：《Chinese Science Bulletin》1999年第16期1460-1463,共4页

摘　　要：It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle.It is proved that for given integerk≥2, almost allk-hypertournaments are strong and in almost allk-hypertournaments, every pair of vertices lies on a 3-cycle.

关 键 词：TOURNAMENT hyper-tournament cycle STRONGLY CONNECTED digraph. 

分 类 号：O226[理学—运筹学与控制论]