Vol. 40, No. 1, 1972

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Cycles in k-strong tournaments

Myron Goldberg and John W. Moon

Vol. 40 (1972), No. 1, 89–96
Abstract

A tournament Tn with n nodes is k-strong if k is the largest integer such that for every partition of the nodes of Tn into two nonempty subsets A and B there are at least k arcs that go from nodes of A to nodes of B and conversely. The main result is that every k-strong tournament has at least k different spanning cycles.

Mathematical Subject Classification 2000
Primary: 05C20
Milestones
Received: 11 December 1970
Revised: 27 April 1971
Published: 1 January 1972
Authors
Myron Goldberg
John W. Moon