The following pages link to On a combinatorial game (Q5905678):
Displayed 44 items.
- The picker-chooser diameter game (Q708229) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- A finite goal set in the plane which is not a winner (Q998393) (← links)
- On chooser-picker positional games (Q1044991) (← links)
- There is no fast method for finding monochromatic complete subgraphs (Q1052332) (← links)
- Van der Waerden and Ramsey type games (Q1054728) (← links)
- On a combinatorial game with an application to go-moku (Q1140042) (← links)
- On positional games (Q1149385) (← links)
- ``Integer-making'' theorems (Q1158443) (← links)
- A matching game (Q1182968) (← links)
- A characterization on \(n\)-critical economical generalized tic-tac-toe games (Q1208360) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- Partitioning the lattice points in \(R^n\) (Q1258307) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Polyomino weak achievement games on 3-dimensional rectangular boards (Q1764904) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Variations on a game (Q1836601) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Hamiltonian cycles in bipartite graphs (Q1894704) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Rectangular polyomino set weak \((1,2)\)-achievement games (Q2378512) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Bases for equational theories of semi-groups (Q2536632) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- On the biased \(n\)-in-a-row game (Q2581405) (← links)
- On Ramsey-type positional games (Q3057062) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
- Winning Fast in Sparse Graph Construction Games (Q3608334) (← links)
- Remarks on positional games. I (Q3663044) (← links)
- The 𝑞-regularity of lattice point paths in 𝑅ⁿ (Q4065551) (← links)
- Discrete threshold growth dynamics are omnivorous for box neighborhoods (Q4226658) (← links)
- Deterministic Graph Games and a Probabilistic Intuition (Q4306428) (← links)
- A Winning Strategy for the Ramsey Graph Game (Q4715271) (← links)
- The accelerated \(k\)-in-a-row game (Q5958336) (← links)