scientific article; zbMATH DE number 3303831
From MaRDI portal
Publication:5585195
zbMath0191.22701MaRDI QIDQ5585195
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Maximum Semiorders in Interval Orders, Optimality in Social Choice, Quasi-Random Set Systems, On the distribution of winners’ scores in a round-robin tournament, Strong subtournaments and cycles of multipartite tournaments, On strongly homogeneous tournaments, Ascending subgraph decompositions of tournaments of order \(6n+3\), Hypertournament matrices, score vectors and eigenvalues, Optimal parallel construction of prescribed tournaments, Reachability problems in edge-colored digraphs, A survey on the linear ordering problem for weighted or unweighted tournaments, IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES, Adjacency Labeling Schemes and Induced-Universal Graphs, Rainbow antistrong connection in tournaments, Sublinear-Time Algorithms for Tournament Graphs, The watchman's walk problem on directed graphs, What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments, Packing arc-disjoint cycles in tournaments, Some problems in discrete optimization, Tight bounds for finding degrees from the adjacency matrix, Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments, (Strong) proper vertex connection of some digraphs, A reversal index for tournament matrices*, Number of Ties and Undefeated Signs in a Generalized Janken, Discrete dynamical systems of Lotka-Volterra and their applications on the modeling of the biogen cycle in ecosystem, On Tournaments and negative dependence, Common kings of a chain of cycles in a strong tournament, Finite groups defined by presentations in which each defining relator involves exactly two generators, Volterra-type quadratic stochastic operators with a homogeneous tournament, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Partition and disjoint cycles in digraphs, Unnamed Item, $\mathcal F$-hypercyclic and disjoint $\mathcal F$-hypercyclic properties of binary relations over topological spaces, The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments, Voting Procedures, Complexity of, Strongly connectable digraphs and non-transitive dice, On the location of the spectrum of hypertournament matrices, Sur la détermination d'une relation binaire à partir d'informations locales, Asymptotic formulas for the number of oriented graphs, Unnamed Item, TSP tour domination and Hamilton cycle decompositions of regular digraphs, Outpaths of arcs in multipartite tournaments, Quasi-random tournaments, Automorphism groups of Walecki tournaments with zero and odd signatures, The discovery and enumeration of representative symbols for circulant tournaments, Graph theory, On multipartite tournament matrices with constant team size∗, Unnamed Item, Intransitive Dice, Robust bounds on choosing from large tournaments, Transitivity in stochastic graphs and digraphs, Domination in Digraphs, A classification of isomorphism-invariant random digraphs, Antidirected Hamiltonian paths in tournaments, Packing Arc-Disjoint Cycles in Tournaments, Unnamed Item, Unnamed Item, The Shifted Turán Sieve Method on Tournaments, Equivalence of n-tournaments via k-path reversals, Ranking players in multiple tournaments, Tournaments and Semicomplete Digraphs, Locally Semicomplete Digraphs and Generalizations, Semicomplete Multipartite Digraphs, \(f\)-structures on the classical flag manifold which admit \((1,2)\)-symplectic metrics, A review of random graphs, Matrices eigenvalues, and directed graphs, Robust bounds on choosing from large tournaments, On the number of tournaments with prescribed score vector, Kings and heirs: a characterization of the \((2, 2)\)-domination graphs of tournaments, The extension to root systems of a theorem on tournaments, Universal tilings and universal (0,1)-matrices, Tournaments, flags, and harmonic maps, Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex, Sophisticated voting outcomes and agenda control, Generalized intransitive dice. II: Partition constructions, The Copeland choice function. An axiomatic characterization, Tournament methods in choice theory, Choosing from a tournament, Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\), Stabbing simplices by points and flats, On a generalization of transitivity for digraphs, Arc reversals in tournaments, Score sets in \(k\)-partite tournaments, Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\), Domination in 3-tournaments, On finding a minimum dominating set in a tournament, Score sequences: Lexicographic enumeration and tournament construction, Asymptotic normality of graph statistics, Bipartite graphs obtained from adjacency matrices of orientations of graphs, On high-dimensional acyclic tournaments, Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs, Note on upper density of quasi-random hypergraphs, Digraphs that have at most one walk of a given length with the same endpoints, The (1,2)-step competition graph of a tournament, On linear programming duality and Landau's characterization of tournament, Coloring the nodes of a directed graph, Hamiltonian-connected tournaments, Cycles in oriented 3-graphs, On the number of Hamiltonian cycles in tournaments, A survey on Hamilton cycles in directed graphs, Weakly quasi-Hamiltonian-connected multipartite tournaments, A four-element algebra whose identities are not finitely based, Maximum distance between Slater orders and Copeland orders of tournaments, Some strategic properties of plurality and majority voting, Cycles in bipartite tournaments, A branch and bound algorithm for the acyclic subgraph problem, On the decomposition of a graph into stars, On incentive compatible competitive selection protocols, Cyclic tournaments and cooperative majority voting: A solution, Every vertex a king, Voting almost maximizes social welfare despite limited communication, The median procedure in cluster analysis and social choice theory, Complexity of finding k-path-free dominating sets in graphs, Sublinear-time algorithms for tournament graphs, The minimal covering set in large tournaments, Yet another method of enumerating unmarked combinatorial objects, Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure, Rainbow connection in oriented graphs, Angle orders and zeros, Ordering pairwise comparison structures, On multipartite tournaments, On tournament matrices, Algebraic multiplicity of the eigenvalues of a tournament matrix, On mark sequences in 2-digraphs, Ranking participants in tournaments by means of rating functions, On biclique partitions of the complete graph, Autonomous parts and decomposition of regular tournaments, Asymptotically optimal induced universal graphs, Integral matrices with given row and column sums, Partitions, packings and coverings by families with nonempty intersections, Towards an axiomatization of orderings, A relativized measure of circularity for tournaments, On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\), Ear decomposition for pair comparison data, A tournament of order 14 with disjoint Banks and Slater sets, Extending partial tournaments, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Path numbers of tournaments, A problem on arcs without bypasses in tournaments, Concordance and consensus, Either tournaments or algebras?, Cycle extendability in graphs and digraphs, Dynamic resource location with tropical algebra, A central partition of molecular conformational space. III. Combinatorial determination of the volume spanned by a molecular system, Hamiltonian degree sequences in digraphs, A note on the query complexity of the Condorcet winner problem, Distances in orientations of graphs, Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs, Edge-disjoint Hamilton cycles in graphs, A characterization of the Copeland solution, Median linear orders: Heuristics and a branch and bound algorithm, The radii of n-partite tournaments, On the complexity of crossings in permutations, Unique nontransitive additive conjoint measurement on finite sets, Choosing from a large tournament, Preserving regular tournaments and term rank-1, A survey on the complexity of tournament solutions, On the complexity of Slater's problems, The interchange graphs of tournaments with minimum score vectors are exactly hypercubes, Canonical Ramsey numbers and properly colored cycles, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Largest digraphs contained in all n-tournaments, On the asymptotic number of tournament score sequences, Upsets in round robin tournaments, The relationship between two algorithms for decisions via sophisticated majority voting with an agenda, On score sets for tournaments, On Ramsey-Turán type problems in tournaments, The energy of the alphabet model, The dichromatic polynomial of a digraph, Primitive 2-structures with the \((n-2)\)-property, On negative dependence inequalities and maximal scores in round-robin tournaments, Extremal problems for pairs of triangles, Note on eccentricities in tournaments, Principal submatrices of co-order one with the biggest Perron root, The Copeland measure of Condorcet choice functions, The reversing number of a digraph, Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Arc reversals of cycles in orientations of \(G\) vertex-multiplications, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, A classification of locally semicomplete digraphs, Path-connectivity in local tournaments, New results on the computation of median orders, Ascending subgraph decompositions of oriented graphs that factor into triangles, Efficient enumeration of graph orientations with sources, Ordered and canonical Ramsey numbers of stars, Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments, On the evolution of a random tournament, On the total distance between nodes in tournaments, A larger class of reconstructible tournaments, On solving intransitivities in repeated pairwise choices, Condorcet choice correspondences: A set-theoretical comparison, Decomposition of tournament limits, On the minimum Perron value for an irreducible tournament matrix, A characterization of unique tournaments, Near-optimal induced universal graphs for cycles and paths, Disjoint cycles of different lengths in graphs and digraphs, The removal lemma for tournaments, The existence and uniqueness of strong kings in tournaments, Elusiveness of finding degrees, An algorithm to generate tournament score sequences, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Hamilton decompositions of regular expanders: applications, A central partition of molecular conformational space. I: Basic structures, Homomorphisms and oriented colorings of equivalence classes of oriented graphs, On approximability of linear ordering and related NP-optimization problems on graphs., On almost regular tournament matrices, Multipartite tournaments: a survey, Weakened WARP and top-cycle choice rules, An oriented version of the 1-2-3 conjecture, On the reducibility of sets inside NP to sets with low information content, The method of dominants in the problem of ranking interval objects specified by three points, Distance-based and ad hoc consensus models in ordinal preference ranking, Strongly self-complementary and hereditarily isomorphic tournaments, Edge sets contained in circuits, Scoring of web pages and tournaments-axiomatizations, Degree constrained 2-partitions of semicomplete digraphs, The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges, Obstructions to locally injective oriented improper colourings, On the chromatic index of almost all graphs, Mixtures of order matrices and generalized order matrices, Coevolutionary systems and PageRank, Manipulation of social choice rules by strategic nomination of candidates, On explicit random-like tournaments, Pick's inequality and tournaments, Solution of the Hamiltonian problem for self-complementary graphs, Spectral radii of tournament matrices whose graphs are related by an arc reversal, Chromatic numbers of competition graphs, On removing a vertex from the assignment polytope, An algorithm for generating partitions and its applications, 2-partition-transitive tournaments, Some asymptotic formulas for lattice paths, Measuring intransitivity, Random generation of tournaments and asymmetric graphs with given out-degrees, On enumerating tournaments that admit exactly one Hamiltonian circuit, Embedding tournaments in simple tournaments, Doubly regular tournaments are equivalent to skew Hadamard matrices, Antidirected Hamilton circuits and paths in tournaments, Internal coverings of sets by asymmetric relations, Ranking whist players, Comparing the efficacy of ranking methods for multiple round-robin tournaments, Parity of paths and circuits in tournaments, On scores in tournaments, Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments, Finding kings in tournaments, The polytope of win vectors, Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number, On \(\lambda\)-majority voting paradoxes, Kings in quasi-transitive digraphs, A combinatorial interpretation of the inverse \(t\)-Kostka matrix., Random regular tournaments, Dynamics on binary relations over topological spaces, Connectivity and extendability in digraphs, Some Ramsey nu mbers for directed graphs, Perron vector ordering for a subclass of tournament matrices, Irreducible matrices with reducible principal submatrices, Oriented Hamiltonian cycles in tournaments, On the maximum number of cyclic triples in oriented graphs, On some useful properties of the Perron eigenvalue of a positive reciprocal matrix in the context of the analytic hierarchy process, On local characterizations of Hamiltonian tournaments, On sets of integers with prescribed gaps, Bounds on the disparity and separation of tournament solutions, Tournament matrices with extremal spectral properties, An upper bound on the Perron value of an almost regular tournament matrix, Properties of the Brualdi-Li tournament matrix, Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\), Coloring the edges of a directed graph, A novel group ranking model for revealing sequence and quantity knowledge
