传递的二部竞赛图的性质

传递的二部竞赛图的性质

谭尚旺;张德龙

【期刊名称】《数学季刊（英文版）》 【年(卷),期】2003(018)004

【摘要】Let Γ*m,n denote all m×n strongly connected bipartite tournaments and α(m,n) the maximal integer k such that every m×n bipartite tournament contains at least a k×k transitive bipartite subtournament. t(Tm,n,k,l)

is

Let the

t(m,n,k,l)=max{t(Tm,n,k,l):Tm,n∈Γ*m,n}, number

of

k×l(k≥2,l≥2)transitive

where

bipartite

subtournaments contained in Tm,n∈Γ*m,n·We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of α(m,n) and obtain t(m,n,k,l). 【总页数】6页(358-363)

【关键词】reverse arc;transitive;bipartite tournament;enumeration 【作者】谭尚旺;张德龙

【作者单位】Department of Applied Mathematics, Petroleum University, Dongying 257061, China;Department of Information and Compute Sciences, Guangxi Institute of Thchnology, Liuzhou 545006, China 【正文语种】中文 【中图分类】O157.5 【相关文献】

1.强连通二部分竞赛图和可约二部分竞赛图计数 [J], 谭尚旺