Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

SCORE SETS IN k-PARTITE TOURNAMENTS

  • Pirzada S. (Department of Mathematics, University of Kashmir) ;
  • Naikoo T.A. (Department of Mathematics, University of Kashmir)
  • 발행 : 2006.09.01

⟨ 이전 논문 다음 논문 ⟩

초록

The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T($X_l,\;X_2, ..., X_k$) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every $n{\ge}k{\ge}2$.

키워드