Pages that link to "Item:Q5611651"
From MaRDI portal
The following pages link to A Constructive Solution to a Tournament Problem (Q5611651):
Displayed 50 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs (Q685676) (← links)
- A construction for Ramsey numbers for \(K_{m,n}\) (Q709236) (← links)
- A note on subdigraphs of digraphs with large outdegrees (Q791535) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Random constructions and density results (Q1009013) (← links)
- Probabilistic methods (Q1091406) (← links)
- The number of submatrices of a given type in a Hadamard matrix and related results (Q1111555) (← links)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions (Q1166570) (← links)
- Roth's estimate of the discrepancy of integer sequences is nearly sharp (Q1167207) (← links)
- Constructions of large arcs and blocking sets in finite planes (Q1180796) (← links)
- Quasi-random subsets of \(\mathbb{Z}_ n\) (Q1194750) (← links)
- Note on the existence of large minimal blocking sets in Galois planes (Q1196692) (← links)
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs (Q1205339) (← links)
- Bounded time-stamps (Q1261108) (← links)
- 2-partition-transitive tournaments (Q1272476) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- Transversal numbers of uniform hypergraphs (Q1813713) (← links)
- The star arboricity of graphs (Q1825208) (← links)
- Absorbing sets in arc-coloured tournaments (Q1827776) (← links)
- On explicit random-like tournaments (Q2042219) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- No additional tournaments are quasirandom-forcing (Q2107498) (← links)
- Ample simplicial complexes (Q2115328) (← links)
- A survey of homogeneous structures (Q2275386) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Character difference digraphs over finite fields (Q2355999) (← links)
- Infinite quasi-transitive digraphs with domination number 2 (Q2357773) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- On an adjacency property of almost all tournaments (Q2433700) (← links)
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes (Q2470461) (← links)
- On the structure of uniform one-factorizations from starters in finite fields (Q2490141) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- Cryptographic hash functions from sequences of lifted Paley graphs (Q2975257) (← links)
- Quasi-random tournaments (Q3351382) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- Suitable Permutations, Binary Covering Arrays, and Paley Matrices (Q3466746) (← links)
- On Symmetric Designs and Binary 3-Frameproof Codes (Q3466753) (← links)
- Quasi-random hypergraphs (Q3490029) (← links)
- Paley graphs satisfy all first-order adjacency axioms (Q3926623) (← links)
- Quasi‐random classes of hypergraphs (Q3970905) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- (Q4638111) (← links)
- Quasi-Random Set Systems (Q4713353) (← links)
- On the number of quasi-kernels in digraphs (Q4736769) (← links)
- Improved boolean formulas for the Ramsey graphs (Q4845078) (← links)
- Infinite Paley graphs (Q4958983) (← links)