The Theory of Round Robin Tournaments
From MaRDI portal
Publication:5518145
DOI10.2307/2315334zbMath0142.41602OpenAlexW4239919431WikidataQ55882928 ScholiaQ55882928MaRDI QIDQ5518145
Publication date: 1966
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2315334
Related Items (50)
Sophisticated voting outcomes and agenda control ⋮ Generalized intransitive dice. II: Partition constructions ⋮ On negative dependence inequalities and maximal scores in round-robin tournaments ⋮ Universal arcs in tournaments ⋮ Team's seasonal win probabilities ⋮ The efficacy of tournament designs ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Tournaments, oriented graphs and football sequences ⋮ On the score sheets of a round-robin football tournament ⋮ On the graph Laplacian and the rankability of data ⋮ Notes on weak-odd edge colorings of digraphs ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Digraphs that have at most one walk of a given length with the same endpoints ⋮ On linear programming duality and Landau's characterization of tournament ⋮ Ranking and selection for pairwise comparison ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Counting tournament score sequences ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ A heuristic method to rectify intransitive judgments in pairwise comparison matrices ⋮ Counting orientations of random graphs with no directed k‐cycles ⋮ Cycles in bipartite tournaments ⋮ Feedback Vertex Sets in Tournaments ⋮ On incentive compatible competitive selection protocols ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ Unnamed Item ⋮ Antimatroids and balanced pairs ⋮ On multipartite tournaments ⋮ Generalized morphology using sponges ⋮ Multipartite tournaments: a survey ⋮ A remark on cycles through an arc in strongly connected multipartite tournaments ⋮ Generalized intransitive dice: mimicking an arbitrary tournament ⋮ Inconsistency reduction in decision making via multi-objective optimisation ⋮ How hard is it to control an election? ⋮ Unnamed Item ⋮ The selection efficiency of tournaments ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ On arc-traceable local tournaments ⋮ Preference graph of potential method as a fuzzy graph ⋮ Circuits of each length in tournaments ⋮ Spectral radii of tournament matrices whose graphs are related by an arc reversal ⋮ On the problem of reconstructing a tournament from subtournaments ⋮ Pancyclic graphs. I ⋮ Contagion in networks: stability and efficiency ⋮ The interchange graphs of tournaments with minimum score vectors are exactly hypercubes ⋮ On score sequences of \(k\)-hypertournaments ⋮ An unexpected characteristic of tournament predictive power ⋮ Score vectors of Kotzig tournaments ⋮ On the number of arcs in primitive digraphs with large exponents
This page was built for publication: The Theory of Round Robin Tournaments
