A Constructive Solution to a Tournament Problem

Cited in

(66)

On the number of quasi-kernels in digraphs
Quasi-orthogonal extension of symmetric matrices
Cryptographic hash functions from sequences of lifted Paley graphs
A survey of homogeneous structures
Covering arrays from cyclotomy
Probabilistic methods
No additional tournaments are quasirandom-forcing
Note on the existence of large minimal blocking sets in Galois planes
scientific article; zbMATH DE number 6866346 (Why is no real title available?)
\(k\)-majority digraphs and the hardness of voting with a constant number of voters
Chromatic number is not tournament-local
On the complexity of Maslov's class K
Binary Covering Arrays and Existentially Closed Graphs
The number of submatrices of a given type in a Hadamard matrix and related results
Deterministic extractors for affine sources over large fields
Suitable permutations, binary covering arrays, and Paley matrices
Ample simplicial complexes
A construction for Ramsey numbers for \(K_{m,n}\)
Quasi-random graphs
Random constructions and density results
2-partition-transitive tournaments
One-dimensional asymptotic classes of finite structures
Functional graphs of families of quadratic polynomials
Derandomizing restricted isometries via the Legendre symbol
Character difference digraphs over finite fields
Roth's estimate of the discrepancy of integer sequences is nearly sharp
Universal graph series, chromatic functions, and their index theory
Tournaments, Johnson graphs and NC-teaching
Transversal numbers of uniform hypergraphs
Covering 2‐colored complete digraphs by monochromatic d d‐dominating digraphs
About kings and dominating sets in tournaments
2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
Constructions of large arcs and blocking sets in finite planes
On explicit random-like tournaments
Quasi-random subsets of \(\mathbb{Z}_ n\)
Private simultaneous messages based on quadratic residues
Quasi‐random classes of hypergraphs
2- and 3-existentially closed tournaments
Approximate counting by hashing in bounded arithmetic
Infinite Paley graphs
The VC dimension of quadratic residues in finite fields
The football model, stochastic ordering and martingale transport
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
The star arboricity of graphs
Quasi-random tournaments
Margin of victory for tournament solutions
On an adjacency property of almost all tournaments
Infinite quasi-transitive digraphs with domination number 2
Finding kings in tournaments
Graphs with the n-e.c. adjacency property constructed from affine planes
On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions
On the structure of uniform one-factorizations from starters in finite fields
The complexity of finding (approximate sized) distance-d dominating set in tournaments
On finding a minimum dominating set in a tournament
Improved boolean formulas for the Ramsey graphs
A note on subdigraphs of digraphs with large outdegrees
Absorbing sets in arc-coloured tournaments
On symmetric designs and binary 3-frameproof codes
The duality gap for two-team zero-sum games
Bounded time-stamps
Quasi-Random Set Systems
Quasi-random hypergraphs
Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
Oriented colourings of graphs with maximum degree three and four
Paley graphs satisfy all first-order adjacency axioms
Some results and problems on tournament structure

This page was built for publication: A Constructive Solution to a Tournament Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5611651)