scientific article; zbMATH DE number 3303831

zbMath0191.22701MaRDI QIDQ5585195

John W. Moon

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

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 ⋮ 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

This page was built for publication: