论文信息 - Uncovered nodes and 3-cycles in tournaments

Uncovered nodes and 3-cycles in tournaments

Let c(Tn) denote the number of 3-cycles in the tournament Tn and let u(Tn) denote the number of nodes i in Tn such that each arc oriented towards i belongs to at least one 3-cycle. We determine the minimum value of c(Tn) when u(Tn) = n and the maximum value of c(Tn) when u(Tn) = 3.

John W. Moon

[1] M. Burzio,et al. Hamiltonian tournaments with the least number of 3-cycles , 1990, J. Graph Theory.

[2] J. Moon. Topics on tournaments , 1968 .

[3] Gary W. Cox,et al. The Uncovered Set and the Core , 1987 .

[4] Barry R. Weingast,et al. Uncovered Sets and Sophisticated Voting Outcomes with Implications for Agenda Institutions , 1984 .

[5] J. Banks. Sophisticated voting outcomes and agenda control , 1984 .

[6] H. Moulin. Choosing from a tournament , 1986 .

[7] Jing Huang,et al. Toppling kings in a tournament by introducing new kings , 1987, J. Graph Theory.

[8] H. Landau. On dominance relations and the structure of animal societies: III The condition for a score structure , 1953 .

[9] B. A. Farbey,et al. Structural Models: An Introduction to the Theory of Directed Graphs , 1966 .

[10] Nicholas R. Miller. A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .

[11] Stephen B. Maurer. The King Chicken Theorems , 1980 .

[12] Li Weixuan,et al. Toppling kings in a tournament by introducing new kings , 1987 .