Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-05T04:00:01.629Z Has data issue: false hasContentIssue false
  • English
  • Français

Bipartite Score Sets

Published online by Cambridge University Press:  20 November 2018

Keith Wayland
Keith Wayland*
Affiliation:
University of Puerto Rico Mayaguez, Puerto Rico 00708
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The question of what sets of integers may be the score sets of bipartite tournaments was posed recently by K. B. Reid. The main theorem of this paper establishes a sufficient condition for pairs of sets to be bipartite score sets. This simple condition yields an immediate affirmative answer for a large class of pairs of sets.

Keywords

05C20
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 26 , Issue 3 , 01 September 1983 , pp. 273 - 279
Copyright
Copyright © Canadian Mathematical Society 1983

References

1. Beineke, L. W. and Moon, J. W., On Bipartite Tournaments and Scores, The Theory and Applications of Graphs, Fourth International Conference Western Michigan University, Kalamazoo, pp. 55-71, John Wiley, 1981.Google Scholar
2. Moon, J. W., On the score sequence of an n-partite tournament, Canadian Mathematical Bulletin, Vol. 5 no. 1, Jan. 1962, pp. 51-58.Google Scholar
3. Moon, J. W., Topics on Tournaments, Holt, , Rinehart, and Winston, , New York, 1968.Google Scholar
4. Reid, K. B., private communication, 1980.Google Scholar