A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large (Q3923884)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large |
scientific article |
Statements
A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large (English)
0 references
1981
0 references
intransitivities in majority rule
0 references
tournament
0 references
infinite number of voters
0 references
Hamiltonian cycle
0 references
random voting graph
0 references
infinitely many alternatives
0 references
