A Constructive Solution to a Tournament Problem
From MaRDI portal
Publication:5611651
DOI10.4153/CMB-1971-007-1zbMath0209.55804WikidataQ56001350 ScholiaQ56001350MaRDI QIDQ5611651
Ronald L. Graham, J. H. Spencer
Publication date: 1971
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
Infinite quasi-transitive digraphs with domination number 2, Quasi‐random classes of hypergraphs, Derandomizing restricted isometries via the Legendre symbol, Probabilistic methods, Quasi-Random Set Systems, Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows, Suitable Permutations, Binary Covering Arrays, and Paley Matrices, On Symmetric Designs and Binary 3-Frameproof Codes, Deterministic extractors for affine sources over large fields, The number of submatrices of a given type in a Hadamard matrix and related results, On finding a minimum dominating set in a tournament, Binary Covering Arrays and Existentially Closed Graphs, Quasi-random hypergraphs, Improved boolean formulas for the Ramsey graphs, The duality gap for two-team zero-sum games, Functional graphs of families of quadratic polynomials, Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs, Private simultaneous messages based on quadratic residues, On an adjacency property of almost all tournaments, Cryptographic hash functions from sequences of lifted Paley graphs, On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions, Roth's estimate of the discrepancy of integer sequences is nearly sharp, Oriented colourings of graphs with maximum degree three and four, The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments, Constructions of large arcs and blocking sets in finite planes, Quasi-random graphs, Graphs with the \(n\)-e.c. adjacency property constructed from affine planes, Quasi-random subsets of \(\mathbb{Z}_ n\), Note on the existence of large minimal blocking sets in Galois planes, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, One-dimensional asymptotic classes of finite structures, Covering arrays from cyclotomy, On the structure of uniform one-factorizations from starters in finite fields, A construction for Ramsey numbers for \(K_{m,n}\), A survey of homogeneous structures, Quasi-random tournaments, Infinite Paley graphs, On explicit random-like tournaments, Random constructions and density results, Bounded time-stamps, Transversal numbers of uniform hypergraphs, Margin of victory for tournament solutions, 2-partition-transitive tournaments, Approximate counting by hashing in bounded arithmetic, \(k\)-majority digraphs and the hardness of voting with a constant number of voters, The star arboricity of graphs, Absorbing sets in arc-coloured tournaments, On the number of quasi-kernels in digraphs, Finding kings in tournaments, Paley graphs satisfy all first-order adjacency axioms, A note on subdigraphs of digraphs with large outdegrees, Unnamed Item, No additional tournaments are quasirandom-forcing, Ample simplicial complexes, Character difference digraphs over finite fields
