Bipartite Score Sets
Canadian mathematical bulletin, Tome 26 (1983) no. 3, pp. 273-279
Voir la notice de l'article provenant de la source Cambridge University Press
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.
Wayland, Keith. Bipartite Score Sets. Canadian mathematical bulletin, Tome 26 (1983) no. 3, pp. 273-279. doi: 10.4153/CMB-1983-044-7
@article{10_4153_CMB_1983_044_7,
author = {Wayland, Keith},
title = {Bipartite {Score} {Sets}},
journal = {Canadian mathematical bulletin},
pages = {273--279},
year = {1983},
volume = {26},
number = {3},
doi = {10.4153/CMB-1983-044-7},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-044-7/}
}
[1] 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] 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] 3. Moon, J. W., Topics on Tournaments, Holt, , Rinehart, and Winston, , New York, 1968. Google Scholar
[4] 4. Reid, K. B., private communication, 1980. Google Scholar
Cité par Sources :