Degree sequences of k-multi-hypertournaments
Let n and k (n ≥ k > 1) be two non-negative integers. A k-multi-hypertournament on n vertices is a pair (V, A), where V is a set of vertices with |V|= n, and A is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V, A contains at least one (at most k!) of the k! k-tuples whose entries belong to S. The necessary and sufficient conditions for a non-decreasing sequence of non-negative integers to be the out-degree sequence (in-degree sequence) of some k-multi-hypertournament are given.
作 者: Pirzada S 作者单位: Department of Mathematics,University of Kashmir,Srinagar,Kashmir,India;King Fahd University of Petroleum and Minerals,Dhahran,Kingdom of Saudi Arabia 刊 名: 高校应用数学学报B辑 英文刊名: APPLIED MATHEMATICS A JOURNAL OF CHINESE UNIVERSITIES,B 年,卷(期): 2009 24(3) 分类号: 关键词: hypergraph hypertournament in-degree out-degree multi-hypertournament