Let Γm,n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n,k, l ) : Tm,n∈Γm,n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive 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 a(m,n) and obtain t (m,n, k,l).
展开▼